### 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 language | English |
---|---|

Pages (from-to) | 4081-4091 |

Number of pages | 11 |

Journal | Theoretical Computer Science |

Volume | 412 |

Issue number | 32 |

DOIs | |

Publication status | Published - Jul 22 2011 |

### Fingerprint

### 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

*Theoretical Computer Science*,

*412*(32), 4081-4091. https://doi.org/10.1016/j.tcs.2010.07.018

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

Research output: Contribution to journal › Article

*Theoretical Computer Science*, vol. 412, no. 32, pp. 4081-4091. https://doi.org/10.1016/j.tcs.2010.07.018

}

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 -