No article text was recorded for this version.
prize-collecting network design
Version 1 of 19 papers15 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Prize-collecting Network Design on Planar Graphs
- Blog: Euclidean Prize-collecting Steiner Forest
- Blog: Euclidean Prize-Collecting Steiner Forest.
- Blog: 2-Approximation for Prize-Collecting Steiner Forest
- Blog: New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
- Blog: A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics
- Blog: Prize-Collecting Steiner Tree: A 1.79 Approximation
- Blog: On the Integrality Gap of the Prize-Collecting Steiner Forest LP
- Blog: Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_prize_collecting_network_design_2f9a5813,
title = {prize-collecting network design},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/prize-collecting-network-design/rdr_2f9a581368654f55bd50205a534725cc},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_prize_collecting_network_design_2f9a5813_v1,
title = {prize-collecting network design},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/prize-collecting-network-design/rdr_2f9a581368654f55bd50205a534725cc/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}