Capacitated Domination Problem
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 96 === We consider a generalization of the well-known domination problem on graphs. The soft capacitated domination problem with demand constraints is to find a dominating set D of minimum cardinality satisfying both the capacity and demand constraints. The capacity co...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/73743858229094012405 |