TY - JOUR

T1 - Bicriteria approximation tradeoff for the node-cost budget problem

AU - Rabani, Yuval

AU - Scalosub, Gabriel

PY - 2009/3/1

Y1 - 2009/3/1

N2 - We consider an optimization problem consisting of an undirected graph, with cost and profit functions defined on all vertices. The goal is to find a connected subset of vertices with maximum total profit, whose total cost does not exceed a given budget. The best result known prior to this work guaranteed a (2, O(log n)) bicriteria approximation that is, the solution's profit is at least a fraction of 1 O(log n) of an optimum solution respecting the budget, while its cost is at most twice the given budget. We improve these results and present a bicriteria tradeoff that, given any e ? (0, 1], guarantees a (1 + e, O( 1 e log n))-approximation.

AB - We consider an optimization problem consisting of an undirected graph, with cost and profit functions defined on all vertices. The goal is to find a connected subset of vertices with maximum total profit, whose total cost does not exceed a given budget. The best result known prior to this work guaranteed a (2, O(log n)) bicriteria approximation that is, the solution's profit is at least a fraction of 1 O(log n) of an optimum solution respecting the budget, while its cost is at most twice the given budget. We improve these results and present a bicriteria tradeoff that, given any e ? (0, 1], guarantees a (1 + e, O( 1 e log n))-approximation.

KW - Approximation algorithms

KW - Bicriteria approximation

UR - http://www.scopus.com/inward/record.url?scp=67149144175&partnerID=8YFLogxK

U2 - 10.1145/1497290.1497295

DO - 10.1145/1497290.1497295

M3 - Article

AN - SCOPUS:67149144175

SN - 1549-6325

VL - 5

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

IS - 2

M1 - 19

ER -