Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Approximation algorithms for maximum matchings in geometric intersection graphs

From MaRDI portal
Publication:6539552
Jump to:navigation, search

DOI10.4230/LIPICS.SOCG.2022.47MaRDI QIDQ6539552FDOQ6539552


Authors: Sariel Har-Peled, Everett Yang Edit this on Wikidata


Publication date: 14 May 2024





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


zbMATH Keywords

approximation algorithmsmatchingsdisk intersection graphs


Mathematics Subject Classification ID

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







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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6539552&oldid=40063130"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 16:19. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki