A constant factor approximation for capacitated min-max tree cover

[PDF] springer.com

A fast -approximation algorithm for capacitated cycle covering

V Traub, T Tröbst - Mathematical Programming, 2022 - Springer
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 vertices with …
被引用次数：7 相关文章 所有 9 个版本
[PDF] uci.edu

[PDF][PDF] Covering

V Traub, T Tröbst - 2021 - ics.uci.edu
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 vertices with …
相关文章 所有 2 个版本

[引用][C] 7)-approximation algorithm for capacitated cycle covering

V Traub, T Tröbst - 2021
相关文章 所有 2 个版本