New Heuristics for the Maximum Bounded-Degree-d Set Problem
碩士 === 國立中正大學 === 資訊工程研究所 === 101 === Given a graph G = (V,E), a bounded-degree-d set S is a vertex subset of G such that the maximum degree in G[S] is at most d. The MAXIMUM BOUNDED-DEGREE-d SET (MAX d-BDS) problem is to find a bounded degree-d set S of maximum cardinality in G. It is an NP-hard pr...
Main Authors: | Hsing-Yi Lei, 雷興怡 |
---|---|
Other Authors: | Maw-Shang Chang |
Format: | Others |
Language: | en_US |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/99839997550701177718 |
Similar Items
-
Heuristics and a Promising Branch-and-Reduce Algorithm for the Maximum Bounded-Degree-1 Set Problem
by: Yi-Chi Liu, et al.
Published: (2013) -
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
by: Gamarnik, David, et al.
Published: (2012) -
On Sequential Heuristic Methods for the Maximum Independent Set Problem
by: Lê Ngoc C., et al.
Published: (2017-05-01) -
Solving set covering problems using heuristics with branch and bound.
by: Nam, Kook Jin
Published: (2012) -
Solving the Set Packing Problem via a Maximum Weighted Independent Set Heuristic
by: Ruizhi Li, et al.
Published: (2020-01-01)