Better s-t-Tours by Gao Trees (Q3186497)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Better s-t-Tours by Gao Trees	scientific article

Statements

scholarly article

0 references

Better s-t-Tours by Gao Trees (English)

0 references

Corinna Gottschalk

0 references

0 references

Integer Programming and Combinatorial Optimization

0 references

publication date

10 August 2016

0 references

full work available at URL

https://arxiv.org/abs/1511.05514

0 references

MaRDI profile type

MaRDI publication profile

0 references

Improving christofides' algorithm for the s-t path TSP

0 references

0 references

Matching, Euler tours and the Chinese postman

0 references

An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem

0 references

On the Metric $s$--$t$ Path Traveling Salesman Problem

0 references

An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem

0 references

The ellipsoid method and its consequences in combinatorial optimization

0 references

The Traveling-Salesman Problem and Minimum Spanning Trees

0 references

Analysis of Christofides' heuristic: some paths are more difficult than cycles

0 references

A Randomized Rounding Approach to the Traveling Salesman Problem

0 references

Eight-Fifth Approximation for the Path TSP

0 references

Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs

0 references

Reassembling Trees for the Traveling Salesman

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-33461-5_11

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3186497

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3186497&oldid=36265743"