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 条

[31] Approximation of the Degree-Constrained Minimum Spanning Hierarchies
Molnar, Miklos
Durand, Sylvain
Merabet, Massinissa
STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, SIROCCO 2014, 2014, 8576 : 96 - 107
[32] Algorithms for degree-constrained Euclidean Steiner minimal tree
Jin, Zhang
Liang, Ma
Zhang Liantang
JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2008, 19 (04) : 735 - 741
[33] Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
R. Ravi
M. V. Marathe
S. S. Ravi
D. J. Rosenkrantz
H. B. Hunt III
Algorithmica, 2001, 31 : 58 - 78
[34] MACHINE SEQUENCING - DISJUNCTIVE GRAPHS AND DEGREE-CONSTRAINED SUBGRAPHS
BALAS, E
NAVAL RESEARCH LOGISTICS QUARTERLY, 1970, 17 (01): : 1 - +
[35] Weight Selection for Gap Robustness with Degree-Constrained Controllers
Karlsson, Johan
Georgiou, Tryphon
Lindquist, Anders
47TH IEEE CONFERENCE ON DECISION AND CONTROL, 2008 (CDC 2008), 2008, : 4127 - 4134
[36] Degree-Constrained Steiner Problem in Graphs with Capacity Constraints
Molnar, Miklos
MATHEMATICS, 2024, 12 (22)
[37] On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems
Sumedh Tirodkar
Sundar Vishwanathan
Algorithmica, 2017, 79 : 909 - 924
[38] On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems
Tirodkar, Sumedh
Vishwanathan, Sundar
ALGORITHMICA, 2017, 79 (03) : 909 - 924
[39] On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems
Tirodkar, Sumedh
Vishwanathan, Sundar
ALGORITHMS AND COMPUTATION, ISAAC 2015, 2015, 9472 : 106 - 115
[40] The degree-constrained multicasting algorithm using ant algorithm
Liu, Y
Wu, JP
Xu, K
Xu, MW
ICT'2003: 10TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS, VOLS I AND II, CONFERENCE PROCEEDINGS, 2003, : 370 - 374

← 1 2 3 4 5 →