Degree-bounded generalized polymatroids and approximating the metric many-visits TSP

Bérczi, KristófKristófBércziBerger, AndréAndréBergerMnich, MatthiasMatthiasMnichVincze, RolandRolandVincze2020-02-242020-02-242019arxiv:1911.09890 (2019)http://hdl.handle.net/11420/5002enhttp://rightsstatements.org/vocab/InC/1.0/generalized polymatroidsdegree constraintstraveling salesman problemMathematikDegree-bounded generalized polymatroids and approximating the metric many-visits TSPPreprint10.15480/882.414310.15480/882.41431911.09890Preprint