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 |