Layers and matroids for the traveling salesman's paths (Q2417048): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Improving Christofides' Algorithm for the s-t Path TSP / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Testing membership in matroid polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5593828 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Better s-t-Tours by Gao Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP / rank | |||
Normal rank |
Revision as of 11:40, 19 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Layers and matroids for the traveling salesman's paths |
scientific article |
Statements
Layers and matroids for the traveling salesman's paths (English)
0 references
11 June 2019
0 references
path traveling salesman problem (TSP)
0 references
matroid partition
0 references
approximation algorithm
0 references
spanning tree
0 references
Christofides' heuristic
0 references
polyhedra
0 references
0 references