Complexity and approximation of the Constrained Forest problem

Cristina Bazgan, Basile Couëtoux, Z. Tuza

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Given an undirected graph on n vertices with weights on its edges, Min WCF (p) consists of computing a covering forest of minimum weight such that each of its tree components contains at least p vertices. It has been proved that Min WCF (p) is NP-hard for any p

Original languageEnglish
Pages (from-to)4081-4091
Number of pages11
JournalTheoretical Computer Science
Volume412
Issue number32
DOIs
Publication statusPublished - Jul 22 2011

Fingerprint

Approximation
Undirected Graph
Covering
NP-complete problem
Computing

Keywords

  • Approximation
  • APX-hardness
  • Bipartite graphs
  • Complexity
  • Constrained Forest
  • Planar graphs
  • Ptas
  • Treewidth

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Complexity and approximation of the Constrained Forest problem. / Bazgan, Cristina; Couëtoux, Basile; Tuza, Z.

In: Theoretical Computer Science, Vol. 412, No. 32, 22.07.2011, p. 4081-4091.

Research output: Contribution to journalArticle

Bazgan, Cristina ; Couëtoux, Basile ; Tuza, Z. / Complexity and approximation of the Constrained Forest problem. In: Theoretical Computer Science. 2011 ; Vol. 412, No. 32. pp. 4081-4091.
@article{2f1b9d7b7f624a3cba8b23bd596bbebd,
title = "Complexity and approximation of the Constrained Forest problem",
abstract = "Given an undirected graph on n vertices with weights on its edges, Min WCF (p) consists of computing a covering forest of minimum weight such that each of its tree components contains at least p vertices. It has been proved that Min WCF (p) is NP-hard for any p",
keywords = "Approximation, APX-hardness, Bipartite graphs, Complexity, Constrained Forest, Planar graphs, Ptas, Treewidth",
author = "Cristina Bazgan and Basile Cou{\"e}toux and Z. Tuza",
year = "2011",
month = "7",
day = "22",
doi = "10.1016/j.tcs.2010.07.018",
language = "English",
volume = "412",
pages = "4081--4091",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "32",

}

TY - JOUR

T1 - Complexity and approximation of the Constrained Forest problem

AU - Bazgan, Cristina

AU - Couëtoux, Basile

AU - Tuza, Z.

PY - 2011/7/22

Y1 - 2011/7/22

N2 - Given an undirected graph on n vertices with weights on its edges, Min WCF (p) consists of computing a covering forest of minimum weight such that each of its tree components contains at least p vertices. It has been proved that Min WCF (p) is NP-hard for any p

AB - Given an undirected graph on n vertices with weights on its edges, Min WCF (p) consists of computing a covering forest of minimum weight such that each of its tree components contains at least p vertices. It has been proved that Min WCF (p) is NP-hard for any p

KW - Approximation

KW - APX-hardness

KW - Bipartite graphs

KW - Complexity

KW - Constrained Forest

KW - Planar graphs

KW - Ptas

KW - Treewidth

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

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

U2 - 10.1016/j.tcs.2010.07.018

DO - 10.1016/j.tcs.2010.07.018

M3 - Article

VL - 412

SP - 4081

EP - 4091

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 32

ER -