Covering graphs using trees and stars

G. Even, N. Garg, J. Könemann, R. Ravi, A. Sinha

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

A tree cover of a graph G is defined as a collection of trees such that their union includes all the vertices of G. The cost of a tree cover is the weight of the maximum weight tree in the tree cover. Given a positive integer k, the k-tree cover problem is to compute a minimum cost tree cover which has no more than k trees. Star covers are defined analogously. Additionally, we may also be provided with a set of k vertices which are to serve as roots of the trees or stars. In this paper, we provide constant factor approximation algorithms for finding tree and star covers of graphs, in the rooted and un-rooted versions.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsSanjeev Asora, Amit Sahai, Klaus Jansen, Jose D.P. Rolim
PublisherSpringer Verlag
Pages24-35
Number of pages12
ISBN (Print)3540407707, 9783540407706
DOIs
StatePublished - 2003

Publication series

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

Fingerprint

Dive into the research topics of 'Covering graphs using trees and stars'. Together they form a unique fingerprint.

Cite this