Approximation algorithms and hardness results for labeled connectivity problems

Refael Hassin, Jérôme Monnot, Danny Segev

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


Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function : E → ℕ. In addition, each label ℓ ℕ to which at least one edge is mapped has a non-negative cost c(ℓ). The minimum label spanning tree problem (MinLST) asks to find a spanning tree in G that minimizes the overall cost of the labels used by its edges. Equivalently, we aim at finding a minimum cost subset of labels 1 ⊆ ℕ such that the edge set (e ∈ E : (e) ∈ I} forms a connected subgraph spanning all vertices. Similarly, in the minimum label s-t path problem (MinLP) the goal is to identify an s-t path minimizing the combined cost of its labels, where s and t are provided as part of the input. The main contributions of this paper are improved approximation algorithms and hardness results for MinLST and MinLP. As a secondary objective, we make a concentrated effort to relate the algorithmic methods utilized in approximating these problems to a number of well-known techniques, originally studied in the context of integer covering.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2006 - 31st International Symposium, MFCS 2006, Proceedings
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540377913, 9783540377917
StatePublished - 2006
Externally publishedYes
Event31st International Symposium on Mathematical Foundations of Computer Science, MFCS 2006 - Stara Lesna, Slovakia
Duration: 28 Aug 20061 Sep 2006

Publication series

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


Conference31st International Symposium on Mathematical Foundations of Computer Science, MFCS 2006
CityStara Lesna

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Approximation algorithms and hardness results for labeled connectivity problems'. Together they form a unique fingerprint.

Cite this