Pages that link to "Item:Q1952507"
From MaRDI portal
The following pages link to Labeled traveling salesman problems: complexity and approximation (Q1952507):
Displayed 4 items.
- The maximum labeled path problem (Q527429) (← links)
- Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134) (← links)
- Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← links)
- Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)