1647 search results - page 33 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
SWAT
1994
Springer
14 years 2 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
IPL
2006
13 years 10 months ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
DCG
2010
13 years 10 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
SODA
1998
ACM
13 years 11 months ago
1998
ACM
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
COMGEO
2010
ACM
13 years 10 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...