A fast $$(2 + frac{2}{7})$$ ( 2 + 2 7 ) -approximation algorithm for capacitated cycle covering |
| |
Authors: | Traub Vera Tröbst Thorben |
| |
Affiliation: | 1.ETH Zürich, Zürich, Switzerland ;2.University of California Irvine, Irvine, CA, USA ; |
| |
Abstract: | Mathematical Programming - We consider the capacitated cycle covering problem: given an undirected, complete graph G with metric edge lengths and demands on the vertices, we want to cover the... |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|