Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs.
Sariel Har-PeledEverett YangPublished in: SoCG (2022)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- minimum cost
- maximum cardinality
- worst case
- vertex cover
- facility location problem
- open shop
- approximation schemes
- network design problem
- approximation ratio
- set cover
- randomized algorithms
- approximation guarantees
- primal dual
- spanning tree
- disjoint paths
- combinatorial auctions
- integrality gap
- integer programming
- constant factor approximation