496 search results - page 16 / 100 » A Polynomial-Time Approximation Algorithm for a Geometric Di... |
126
click to vote
HICSS
2008
IEEE
15 years 9 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...
127
click to vote
IWPEC
2004
Springer
15 years 7 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...
130
click to vote
ICALP
2011
Springer
14 years 6 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
15 years 8 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...