The following pages link to (Q4395317):
Displaying 7 items.
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- Performance guarantees for the TSP with a parameterized triangle inequality (Q294711) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Faster geometric \(k\)-point MST approximation (Q1370933) (← links)
- Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
