# Degree-Constrained Subgraph Problems: Hardness and Approximation Results

2 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : A general instance of a Degree-Constrained Subgraph problem consists of an edge-weighted or vertex-weighted graph G and the objective is to find an optimal weighted subgraph, subject to certain degree constraints on the vertices of the subgraph. This paper considers three natural Degree-Constrained Subgraph problems and studies their behavior in terms of approximation algorithms. These problems take as input an undirected graph G=(V,E), with |V|=n and |E|=m. Our results, together with the definition of the three problems, are listed below. 1- The Maximum Degree-Bounded Connected Subgraph (MDBCS_d) problem takes as input a weight function w: E -> R+ and an integer d>1, and asks for a subset of edges E' such that the subgraph G'=(V,E') is connected, has maximum degree at most d, and the total edge-weight is maximized. We prove that MDBCS_d is not in APX for any d>1 (this was known only for d=2) and we provide a min{m/log n, nd/2log n}-approximation algorithm for unweighted graphs, and a min{n/2,m/d}-approximation algorithm for weighted graphs. 2- The Minimum Subgraph of Minimum Degree d (MSMD_d) problem consists in finding a smallest subgraph of G (in terms of number of vertices) with minimum degree at least d. For d=2 it corresponds to finding a shortest cycle of the graph. We prove that MSMD_d is not in APX for any d>2 and we provide an n/logn-approximation algorithm for the classes of graphs excluding a fixed graph as a minor, using dynamic programming techniques and a known structural result on graph minors. 3- The Dual Degree-Dense k-Subgraph (DDDkS) problem consists in finding a subgraph H of G such that |V(H)|
Document type :
Reports

Cited literature [1 references]

https://hal.inria.fr/inria-00331747
Contributor : Ignasi Sau Valls Connect in order to contact the contributor
Submitted on : Friday, October 17, 2008 - 3:05:02 PM
Last modification on : Thursday, March 17, 2022 - 10:08:13 AM
Long-term archiving on: : Tuesday, September 18, 2012 - 12:20:31 PM

### Files

RR-6690.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : inria-00331747, version 1

### Citation

Omid Amini, David Peleg, Stéphane Pérennes, Saket Saurabh. Degree-Constrained Subgraph Problems: Hardness and Approximation Results. [Research Report] RR-6690, INRIA. 2008. ⟨inria-00331747⟩

Record views