2698 search results - page 11 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
SODA
1992
ACM
14 years 10 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
SIAMCOMP
2010
14 years 4 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
CCCG
2010
14 years 11 months ago
2010
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...