Approximation algorithms for maximum latency and partial cycle cover

DOI10.1016/j.disopt.2008.12.003zbMath1159.90496OpenAlexW1970404064MaRDI QIDQ1015324

Refael Hassin, Asaf Levin, Shlomi Rubinstein

Publication date: 7 May 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2008.12.003

zbMATH Keywords

approximation algorithmsmaximum latencypartial cycle cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Matching is as easy as matrix inversion
• Better approximations for max TSP
• A \(\frac78\)-approximation algorithm for metric Max TSP
• An improved randomized approximation algorithm for Max TSP
• Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
• Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
• 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
• Combinatorial Optimization with Rational Objective Functions
• Approximating Capacitated Routing and Delivery Problems
• Robust Matchings

This page was built for publication: Approximation algorithms for maximum latency and partial cycle cover