5595 search results - page 39 / 1119 » Approximation Algorithms for Clustering Problems |
123
click to vote
JCSS
2010
15 years 1 months ago
2010
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization ...
113
Voted
SODA
2003
ACM
15 years 3 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
164
Voted
IPCO
2001
15 years 3 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
101
click to vote
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
167
click to vote
WG
2005
Springer
15 years 8 months ago
2005
Springer
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...