Approximating the Bipartite TSP and Its Biased Generalization

DOI10.1007/978-3-319-04657-0_8zbMath1408.90262OpenAlexW2164066496MaRDI QIDQ5746245

Hiroshi Nagamochi, Yoshiyuki Karuno, Aleksandar Shurbevski

Publication date: 18 February 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04657-0_8

zbMATH Keywords

combinatorial optimizationapproximation algorithmmatroid intersectionbiased costbipartite TSPmaterial handling robot

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (3)

Constant factor approximation algorithm for TSP satisfying a biased triangle inequality ⋮ Polynomially solvable cases of the bipartite traveling salesman problem ⋮ A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality

This page was built for publication: Approximating the Bipartite TSP and Its Biased Generalization