2026-07-25T11:27:16Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:16055 2024-03-06T10:56:51Z ddc:004 open_access

Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs Har-Peled, Sariel Yang, Everett Matchings disk intersection graphs approximation algorithms We present a (1-ε)-approximation algorithms for maximum cardinality matchings in disk intersection graphs - all with near linear running time. We also present an estimation algorithm that returns (1±ε)-approximation to the size of such matchings - this algorithm runs in linear time for unit disks, and O(n log n) for general disks (as long as the density is relatively small). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sariel Har-Peled and Everett Yang 2022 Is Part Of LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SoCG.2022.47 urn:nbn:de:0030-drops-160555 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.47 eng https://creativecommons.org/licenses/by/4.0/legalcode