On the approximability of some degree-constrained subgraph problems - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Discrete Applied Mathematics Year : 2012

On the approximability of some degree-constrained subgraph problems

Abstract

In this article we provide hardness results and approximation algorithms for the following three natural degree-constrained subgraph problems, which take as input an undirected graph G=(V,E). Let d>=2 be a fixed integer. The Maximumd-degree-bounded Connected Subgraph (MDBCS"d) problem takes as additional input a weight function @w:E->R^+, and asks for a subset E^'@?E such that the subgraph induced by E^' is connected, has maximum degree at most d, and @?"e"@?"E"^"'@w(e) is maximized. The Minimum Subgraph of Minimum Degree>=d (MSMD"d) problem involves finding a smallest subgraph of G with minimum degree at least d. Finally, the Dual Degree-densek-Subgraph (DDDkS) problem consists in finding a subgraph H of G such that |V(H)|@?k and the minimum degree in H is maximized.

Dates and versions

lirmm-00736702 , version 1 (28-09-2012)

Identifiers

Cite

Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh. On the approximability of some degree-constrained subgraph problems. Discrete Applied Mathematics, 2012, 160 (2), pp.1661-1679. ⟨10.1016/j.dam.2012.03.025⟩. ⟨lirmm-00736702⟩
232 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More