The Approximability of Capacitated Vertex Cover Problem with Relaxed Constraints
博士 === 國立臺灣大學 === 資訊工程學研究所 === 107 === In this dissertation, we aim to address the approximability of the capacitated vertex cover (CVC) problem, i.e., a generic demand-to-service assignment model of the classical vertex cover problem, when certain constraints of interest are relaxed. In CVC, we are...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/jkt8fr |