The following pages link to (Q4840777):
Displaying 7 items.
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- Progressive scattered data filtering. (Q1410867) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- Approximability results for the $p$-centdian and the converse centdian problems (Q6045453) (← links)
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives (Q6053591) (← links)
- A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem (Q6068702) (← links)
- A constructive heuristic for the uniform capacitated vertex \(k\)-center problem (Q6579775) (← links)
