Inapproximability of shortest paths on perfect matching polytopes (Q7019074)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7996001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inapproximability of shortest paths on perfect matching polytopes |
scientific article; zbMATH DE number 7996001 |
Statements
Inapproximability of shortest paths on perfect matching polytopes (English)
0 references
5 March 2025
0 references
polytopes
0 references
perfect matchings
0 references
linear programming
0 references
simplex method
0 references
pivot rules
0 references
circuit-augmentation
0 references
inapproximability
0 references
combinatorial reconfiguration
0 references
0 references
