New LP relaxations for minimum cycle/path/tree cover problems

DOI10.1007/978-3-030-04618-7_18MaRDI QIDQ6073046zbMATH OpenOpenAlexFDO

Authors Wei Yu, Zhaohui Liu, Xiaoguang Bao

Publication date 16 October 2023

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-04618-7_18

zbMATH Keywords

approximation algorithmcycle coverintegrality gappath covervehicle routing

Mathematics Subject Classification ID

Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• New LP relaxations for minimum cycle/path/tree cover problems
• Improved approximation algorithms for some min-max and minimum cycle cover problems
• New approximation algorithms for the minimum cycle cover problem
• New approximation algorithms for the minimum cycle cover problem
• Improved approximation algorithms for min-max and minimum vehicle routing problems

Cited in

(1)

• New LP relaxations for minimum cycle/path/tree cover problems

This page was built for publication: New LP relaxations for minimum cycle/path/tree cover problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6073046)