A better approximation algorithm for the budget prize collecting tree problem.
From MaRDI portal
Publication:703233
DOI10.1016/j.orl.2003.11.002zbMath1052.05065MaRDI QIDQ703233
Publication date: 11 January 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2003.11.002
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems, Prize-Collecting TSP with a Budget Constraint, A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
Cites Work