106 search results - page 2 / 22 » SDP-Based Algorithms for Maximum Independent Set Problems on... |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
IWOCA
2010
Springer
13 years 7 hour ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
WASA
2009
Springer
13 years 11 months ago
2009
Springer
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose...
WG
2005
Springer
13 years 10 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...
WG
2004
Springer
13 years 10 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...