5595 search results - page 43 / 1119 » Approximation Algorithms for Clustering Problems |
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
146
Voted
DAM
2000
15 years 2 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
132
Voted
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
133
Voted
FOCS
2005
IEEE
15 years 8 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
121
Voted
ENTCS
2008
15 years 2 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...