A better approximation algorithm for the budget prize collecting tree problem.

DOI10.1016/J.ORL.2003.11.002zbMath1052.05065OpenAlexW1995327008MaRDI QIDQ703233

Asaf Levin

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

zbMATH Keywords

Approximation algorithmssubtree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems ⋮ Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems ⋮ Prize-Collecting TSP with a Budget Constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation Schemes for the Restricted Shortest Path Problem
• The SONET edge‐partition problem
• A General Approximation Technique for Constrained Forest Problems

This page was built for publication: A better approximation algorithm for the budget prize collecting tree problem.