496 search results - page 16 / 100 » A Polynomial-Time Approximation Algorithm for a Geometric Di... |
HICSS
2008
IEEE
14 years 2 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
IWPEC
2004
Springer
14 years 1 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
COCOON
2010
Springer
13 years 12 months ago
2010
Springer