Pages that link to "Item:Q5711527"
From MaRDI portal
The following pages link to SOFSEM 2005: Theory and Practice of Computer Science (Q5711527):
Displaying 6 items.
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Analysis of Christofides' heuristic: some paths are more difficult than cycles (Q1180833) (← links)
- The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
- The Complexity of Restricted Variants of the Stable Paths Problem (Q3000275) (← links)
- (Q4607918) (← links)
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem (Q6163623) (← links)