Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs.
Sariel Har-PeledEverett YangPublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- maximum cardinality
- vertex cover
- minimum cost
- worst case
- facility location problem
- integrality gap
- graph matching
- approximation schemes
- network design problem
- approximation guarantees
- bipartite graph
- open shop
- weighted graph
- set cover
- primal dual
- approximation ratio
- disjoint paths
- randomized algorithms
- constant factor approximation
- precedence constraints
- spanning tree
- graph structure
- combinatorial auctions
- lower bound
- computational complexity
- np hardness
- minimum weight
- directed graph
- metaheuristic