Approximation Algorithms for Capacitated Domination Problem
碩士 === 臺灣大學 === 資訊工程學研究所 === 98 === We consider the Capacitated Domination problem, which models a service requirement assignment scenario and is also a generalization of the well known Dominating Set problem. In this problem, given a graph with three parameters defined on each vertex, namely cost...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/22158579659765670266 |
id |
ndltd-TW-098NTU05392021 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-098NTU053920212015-10-13T18:49:38Z http://ndltd.ncl.edu.tw/handle/22158579659765670266 Approximation Algorithms for Capacitated Domination Problem 有容量的支配集問題的近似演算法 Han-Lin Chen 陳翰霖 碩士 臺灣大學 資訊工程學研究所 98 We consider the Capacitated Domination problem, which models a service requirement assignment scenario and is also a generalization of the well known Dominating Set problem. In this problem, given a graph with three parameters defined on each vertex, namely cost, capacity, and demand, we want to find an assignment of demands to vertices of least cost such that the demand of each vertex is satisfied subject to the capacity constraint of each vertex providing the service. In terms of polynomial time approximations, we present logarithmic approximation algorithms with respect to different demand assignment models for this problem on general graphs, which also establishes the corresponding approximating results to the well-known approximations of the traditional Dominating Set problem. Together with previously known results, this closes the problem of generally approximating the optimal solution. Der-Tsai Lee 李德財 2010 學位論文 ; thesis 37 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 臺灣大學 === 資訊工程學研究所 === 98 === We consider the Capacitated Domination problem, which models a service requirement assignment scenario and is also a generalization of the well known Dominating Set problem. In this problem, given a graph with three parameters defined on each vertex, namely cost, capacity, and demand, we want to find an assignment of demands to vertices of least cost such that the demand of each vertex is satisfied subject to the capacity constraint of each vertex providing the service.
In terms of polynomial time approximations, we present logarithmic approximation algorithms with respect to different demand assignment models for this problem on general graphs, which also establishes the corresponding
approximating results to the well-known approximations of the traditional Dominating Set problem. Together with previously known results, this closes the problem of generally approximating the optimal solution.
|
author2 |
Der-Tsai Lee |
author_facet |
Der-Tsai Lee Han-Lin Chen 陳翰霖 |
author |
Han-Lin Chen 陳翰霖 |
spellingShingle |
Han-Lin Chen 陳翰霖 Approximation Algorithms for Capacitated Domination Problem |
author_sort |
Han-Lin Chen |
title |
Approximation Algorithms for Capacitated Domination Problem |
title_short |
Approximation Algorithms for Capacitated Domination Problem |
title_full |
Approximation Algorithms for Capacitated Domination Problem |
title_fullStr |
Approximation Algorithms for Capacitated Domination Problem |
title_full_unstemmed |
Approximation Algorithms for Capacitated Domination Problem |
title_sort |
approximation algorithms for capacitated domination problem |
publishDate |
2010 |
url |
http://ndltd.ncl.edu.tw/handle/22158579659765670266 |
work_keys_str_mv |
AT hanlinchen approximationalgorithmsforcapacitateddominationproblem AT chénhànlín approximationalgorithmsforcapacitateddominationproblem AT hanlinchen yǒuróngliàngdezhīpèijíwèntídejìnshìyǎnsuànfǎ AT chénhànlín yǒuróngliàngdezhīpèijíwèntídejìnshìyǎnsuànfǎ |
_version_ |
1718037573875531776 |