On the approximability of some degree-constrained subgraph problems

被引：18

作者：

Amini, Omid ^{[2
]}

Peleg, David ^{[3
]}

Perennes, Stephane ^{[4
]}

Sau, Ignasi ^{[1
]}

Saurabh, Saket ^{[5
]}

机构：

[1] CNRS, LIRMM, Montpellier, France

[2] Ecole Normale Super, CNRS, DMA, Paris, France

[3] Weizmann Inst Sci, IL-76100 Rehovot, Israel

[4] INRIA CNRS UNS, Mascotte project, Sophia Antipolis, France

[5] Inst Math Sci, Chennai 600113, Tamil Nadu, India

来源：

DISCRETE APPLIED MATHEMATICS | 2012年 / 160卷 / 12期

关键词：

Degree-constrained subgraph; Approximation algorithms; Hardness of approximation; DENSE K-SUBGRAPH; APPROXIMATION; OPTIMIZATION; COMPLEXITY; HARDNESS; PATH;

D O I：

10.1016/j.dam.2012.03.025

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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 MAXIMUM d - DEGREE-BOUNDED CONNECTED SUBGRAPH (MDBCSd) problem takes as additional input a weight function omega : E -> R+, and asks for a subset E' subset of E such that the subgraph induced by E' is connected, has maximum degree at most d, and Sigma(e is an element of E') omega(e) is maximized. The MINIMUM SUBGRAPH OF MINIMUM DEGREE >= d (MSMDd) problem involves finding a smallest subgraph of G with minimum degree at least d. Finally, the DUAL DEGREE-DENSE k-SUBGRAPH (DDDkS) problem consists in finding a subgraph H of G such that vertical bar V(H)vertical bar <= k and the minimum degree in H is maximized. (C) 2012 Elsevier B.V. All rights reserved.

引用

页码：1661 / 1679

页数：19

共 50 条

[41] Parameterized complexity of finding small degree-constrained subgraphs
Amini, Omid
Sau, Ignasi
Saurabh, Saket
JOURNAL OF DISCRETE ALGORITHMS, 2012, 10 : 70 - 83
[42] Fuzzy Degree-Constrained Minimum Spanning Tree problem
Lu, Yiwen
Proceedings of the Fifth International Conference on Information and Management Sciences, 2006, 5 : 578 - 584
[43] Degree-constrained multihop scatternet formation for Bluetooth networks
Petrioli, C
Basagni, S
GLOBECOM'02: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-3, CONFERENCE RECORDS: THE WORLD CONVERGES, 2002, : 222 - 226
[44] Algorithms for degree-constrained Euclidean Steiner minimal tree
Zhang Jin1
2.Computer and Information Engineering Coll.
Journal of Systems Engineering and Electronics, 2008, (04) : 735 - 741
[45] Heuristic algorithm for degree-constrained minimum spanning tree
Liao, Fei-Xiong
Ma, Liang
Shanghai Ligong Daxue Xuebao/Journal of University of Shanghai for Science and Technology, 2007, 29 (02): : 142 - 144
[46] Topology formation in degree-constrained directional antenna networks
Duke, Martin
Pei, Guangyu
Kim, Jae H.
2007 IEEE MILITARY COMMUNICATIONS CONFERENCE, VOLS 1-8, 2007, : 254 - 259
[47] Approximation algorithms for degree-constrained bipartite network flow
Akçali, E
Üngör, A
COMPUTER AND INFORMATION SCIENCES - ISCIS 2003, 2003, 2869 : 163 - 170
[48] Degree-constrained decompositions of graphs: Bounded treewidth and planarity
Bazgan, C
Tuza, Z
Vanderpooten, D
THEORETICAL COMPUTER SCIENCE, 2006, 355 (03) : 389 - 395
[49] Degree-Constrained Minimum Spanning Tree Problem in Stochastic Graph
Torkestani, Javad Akbari
CYBERNETICS AND SYSTEMS, 2012, 43 (01) : 1 - 21
[50] On Degree-Constrained Analytic Interpolation With Interpolation Points Close to the Boundary
Karlsson, Johan
Lindquist, Anders
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2009, 54 (06) : 1412 - 1418

← 1 2 3 4 5 →