TY - GEN

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

AU - Rabani, Yuval

AU - Scalosub, Gabriel

PY - 2008/10/27

Y1 - 2008/10/27

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(logn)) bicriteria approximation, i.e. the solution's profit is at least a fraction of 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 ε∈ ∈(0,1], guarantees a -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(logn)) bicriteria approximation, i.e. the solution's profit is at least a fraction of 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 ε∈ ∈(0,1], guarantees a -approximation.

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

U2 - 10.1007/978-3-540-69903-3_10

DO - 10.1007/978-3-540-69903-3_10

M3 - Conference contribution

AN - SCOPUS:54249118780

SN - 3540699007

SN - 9783540699002

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 90

EP - 101

BT - Algorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings

T2 - 11th Scandinavian Workshop on Algorithm Theory, SWAT 2008

Y2 - 2 July 2008 through 4 July 2008

ER -