scientific article

zbMath0984.90049MaRDI QIDQ2741462

Anand Srivastav, Andreas Baltz, Tomasz Schoen

Publication date: 24 October 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmbipartite traveling salesman problemshort tour

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• On optimal matchings
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?
• Unnamed Item

This page was built for publication: