Approximation algorithms for maximum independent set of a unit disk graph.
Gautam K. DasMinati DeSudeshna KolaySubhas C. NandySusmita Sur-KolayPublished in: Inf. Process. Lett. (2015)
Keyphrases
- approximation algorithms
- maximum independent set
- graph theory
- graph theoretic
- independent set
- special case
- np hard
- undirected graph
- minimum cost
- vertex cover
- constant factor
- worst case
- facility location problem
- network design problem
- primal dual
- precedence constraints
- approximation ratio
- disjoint paths
- np hardness
- randomized algorithms
- directed graph
- maximum weight
- social network analysis
- approximation schemes
- set cover
- open shop
- linear programming
- computational complexity
- constant factor approximation
- minimum spanning tree
- network flow
- combinatorial auctions
- weighted graph
- graph structure
- simulated annealing
- connected components
- combinatorial optimization
- complex networks