مورد إلكتروني
Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs
| العنوان: | Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs |
|---|---|
| بيانات النشر: | LIPIcs - Leibniz International Proceedings in Informatics. 38th International Symposium on Computational Geometry (SoCG 2022) 2022 |
| تفاصيل مُضافة: | Har-Peled, Sariel Yang, Everett |
| نوع الوثيقة: | Electronic Resource |
| مصطلحات الفهرس: | Matchings, disk intersection graphs, approximation algorithms, Data processing Computer science, InProceedings, publishedVersion |
| DOI: | 10.4230.LIPIcs.SoCG.2022.47 |
| الإتاحة: | Open access content. Open access content https://creativecommons.org/licenses/by/4.0 |
| ملاحظة: | application/pdf English |
| أرقام أخرى: | DEDAG oai:drops-oai.dagstuhl.de:16055 doi:10.4230/LIPIcs.SoCG.2022.47 urn:nbn:de:0030-drops-160555 https://drops.dagstuhl.de/opus/volltexte/2022/16055/ 1335413346 |
| المصدر المساهم: | SCHLOSS DAGSTUHL LEIBNIZ ZENTRUM GMBH From OAIster®, provided by the OCLC Cooperative. |
| رقم الأكسشن: | edsoai.on1335413346 |
| قاعدة البيانات: | OAIster |
| DOI: | 10.4230.LIPIcs.SoCG.2022.47 |
|---|