Heuristics and a Promising Branch-and-Reduce Algorithm for the Maximum Bounded-Degree-1 Set Problem
碩士 === 國立中正大學 === 資訊工程研究所 === 101 === Given a graph G = (V, E), a bounded-degree-1 set S is a vertex subset of G such that the maximum degree in G[S] is at most one. The Maximum Bounded-Degree-1 Set "Max 1-bds" problem is to find a bounded-degree-1 set S of maximum cardinality in G. It is...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/01896257938363790021 |
id |
ndltd-TW-100CCU00392085 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-100CCU003920852015-10-13T22:12:40Z http://ndltd.ncl.edu.tw/handle/01896257938363790021 Heuristics and a Promising Branch-and-Reduce Algorithm for the Maximum Bounded-Degree-1 Set Problem 最大有限分支度一集合問題之啟發式演算法與分支化約演算法研究 Yi-Chi Liu 劉奕志 碩士 國立中正大學 資訊工程研究所 101 Given a graph G = (V, E), a bounded-degree-1 set S is a vertex subset of G such that the maximum degree in G[S] is at most one. The Maximum Bounded-Degree-1 Set "Max 1-bds" problem is to find a bounded-degree-1 set S of maximum cardinality in G. It is an NP-hard problem and can not be approximated to a ratio greater than n^{e-1} in polynomial time for all e > 0 unless P = NP. In this thesis, we design and implement heuristic algorithms and branch-and-reduce algorithms based on variant strategies. Our the branch-and-reduce algorithms apply a very simple branching rule. From the experiment results, we observe that our heuristic algorithms find solutions with good qualities, and our branch-and-reduce algorithms are more efficient than the algorithm given by Moser et al. in most of test instances. Bang-Ye Wu Maw-Shang Chang 吳邦一 張貿翔 2013 學位論文 ; thesis 45 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立中正大學 === 資訊工程研究所 === 101 === Given a graph G = (V, E), a bounded-degree-1 set S is a vertex subset of G such that the maximum degree in G[S] is at most one. The Maximum Bounded-Degree-1 Set "Max 1-bds" problem is to find a bounded-degree-1 set S of maximum cardinality in G.
It is an NP-hard problem and can not be approximated to a ratio greater than n^{e-1} in polynomial time for all e > 0 unless P = NP.
In this thesis, we design and implement heuristic algorithms and branch-and-reduce algorithms based on variant strategies.
Our the branch-and-reduce algorithms apply a very simple branching rule. From the experiment results, we observe that our heuristic algorithms find solutions with good qualities, and our branch-and-reduce algorithms are more efficient than the algorithm given by Moser et al. in most of test instances.
|
author2 |
Bang-Ye Wu |
author_facet |
Bang-Ye Wu Yi-Chi Liu 劉奕志 |
author |
Yi-Chi Liu 劉奕志 |
spellingShingle |
Yi-Chi Liu 劉奕志 Heuristics and a Promising Branch-and-Reduce Algorithm for the Maximum Bounded-Degree-1 Set Problem |
author_sort |
Yi-Chi Liu |
title |
Heuristics and a Promising Branch-and-Reduce Algorithm for the Maximum Bounded-Degree-1 Set Problem |
title_short |
Heuristics and a Promising Branch-and-Reduce Algorithm for the Maximum Bounded-Degree-1 Set Problem |
title_full |
Heuristics and a Promising Branch-and-Reduce Algorithm for the Maximum Bounded-Degree-1 Set Problem |
title_fullStr |
Heuristics and a Promising Branch-and-Reduce Algorithm for the Maximum Bounded-Degree-1 Set Problem |
title_full_unstemmed |
Heuristics and a Promising Branch-and-Reduce Algorithm for the Maximum Bounded-Degree-1 Set Problem |
title_sort |
heuristics and a promising branch-and-reduce algorithm for the maximum bounded-degree-1 set problem |
publishDate |
2013 |
url |
http://ndltd.ncl.edu.tw/handle/01896257938363790021 |
work_keys_str_mv |
AT yichiliu heuristicsandapromisingbranchandreducealgorithmforthemaximumboundeddegree1setproblem AT liúyìzhì heuristicsandapromisingbranchandreducealgorithmforthemaximumboundeddegree1setproblem AT yichiliu zuìdàyǒuxiànfēnzhīdùyījíhéwèntízhīqǐfāshìyǎnsuànfǎyǔfēnzhīhuàyuēyǎnsuànfǎyánjiū AT liúyìzhì zuìdàyǒuxiànfēnzhīdùyījíhéwèntízhīqǐfāshìyǎnsuànfǎyǔfēnzhīhuàyuēyǎnsuànfǎyánjiū |
_version_ |
1718074320818798592 |