3875 search results - page 3 / 775 » Approximation algorithms for the 0-extension problem |
OL
2008
14 years 11 months ago
2008
Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorith...
108
click to vote
JCSS
2002
14 years 11 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
100
click to vote
JCSS
2010
14 years 10 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 ...
170
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
JGAA
2000
14 years 11 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...