Bicriteria approximation tradeoff for the node-cost budget problem

Yuval Rabani, Gabriel Scalosub

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


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.

Original languageEnglish
Title of host publicationAlgorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings
Number of pages12
StatePublished - 27 Oct 2008
Externally publishedYes
Event11th Scandinavian Workshop on Algorithm Theory, SWAT 2008 - Gothenburg, Sweden
Duration: 2 Jul 20084 Jul 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5124 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference11th Scandinavian Workshop on Algorithm Theory, SWAT 2008

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Bicriteria approximation tradeoff for the node-cost budget problem'. Together they form a unique fingerprint.

Cite this