Degree-Constrained Subgraph Problems: Hardness and Approximation Results - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2008

Degree-Constrained Subgraph Problems: Hardness and Approximation Results

Résumé

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)|
Fichier principal
Vignette du fichier
RR-6690.pdf (572.92 Ko) Télécharger le fichier
Amply_bis.pdf (6.44 Ko) Télécharger le fichier
tree.pdf (7.71 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Origine Fichiers produits par l'(les) auteur(s)
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00331747 , version 1 (17-10-2008)

Identifiants

  • HAL Id : inria-00331747 , version 1

Citer

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⟩
286 Consultations
341 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More