Approximation algorithms for maximum matchings in geometric intersection graphs

DOI10.4230/LIPICS.SOCG.2022.47MaRDI QIDQ6539552zbMATH OpenFDO

Authors Sariel Har-Peled, Everett Yang

Publication date 14 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2022.47

zbMATH Keywords

approximation algorithmsdisk intersection graphsmatchings

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Approximation Algorithms for Geometric Intersection Graphs
• New approximation results on graph matching and related problems
• Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
• scientific article; zbMATH DE number 3965443
• Distributed Approximation Algorithms in Unit-Disk Graphs

Cited in

(2)

• Geometric matching and bottleneck problems
• Shortest path separators in unit disk graphs

This page was built for publication: Approximation algorithms for maximum matchings in geometric intersection graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6539552)