Node-weighted Steiner tree approximation in unit disk graphs
Year of publication: |
2009
|
---|---|
Authors: | Zou, Feng ; Li, Xianyue ; Gao, Suogang ; Wu, Weili |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 18.2009, 4, p. 342-349
|
Subject: | Netzplantechnik | Project network techniques | Graphentheorie | Graph theory | Algorithmus | Algorithm |
-
Approximations for node-weighted Steiner tree in unit disk graphs
Xu, X., (2010)
-
An exact method for the biobjective shortest path problem for large-scale road networks
Duque, Daniel, (2015)
-
A strongly polynomial contraction-expansion algorithm for network flow problems
Gauthier, Jean Bertrand, (2017)
- More ...
-
Constructing error-correcting pooling designs with symplectic space
Guo, Jun, (2010)
-
Li, Zengti, (2010)
-
Zhang, Wei, (2012)
- More ...