Approximations for node-weighted Steiner tree in unit disk graphs
| Year of publication: |
2010
|
|---|---|
| Authors: | Xu, X. ; Wang, Y. ; Du, H. ; Wan, P.-J. ; Zou, F. |
| Published in: |
Optimization letters. - Berlin : Springer, ISSN 1862-4472, ZDB-ID 2274663-8. - Vol. 4.2010, 3, p. 405-416
|
| Subject: | Graphentheorie | Graph theory | Algorithmus | Algorithm | Netzplantechnik | Project network techniques |
-
Exact approaches for the directed network design problem with relays
Leitner, Markus, (2020)
-
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 ...
-
Wang, Qinru, (2024)
-
Zhao, Yu, (2024)
-
Visualization service investment strategies for a self-operated fresh agricultural product e-tailer
Du, Heng, (2023)
- More ...