17 search results - page 1 / 4 » Approximating min-max k-clustering |
COCOON
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
APPROX
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
ACTA
2004
13 years 5 months ago
2004
CDC
2008
IEEE
13 years 12 months ago
2008
IEEE
— In this paper we study the relationship between the parameter θ, used in the design of the MinMax controller, and the conditioning of the approximate algebraic Riccati equatio...