Výsledky vyhledávání - "efficient polynomial-time approximation scheme"

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets

Autoři: Doron-Arad, Ilan Kulik, Ariel Shachnai, Hadas a další

Přispěvatelé: Doron-Arad, Ilan Kulik, Ariel Shachnai, Hadas a další

Témata: budgeted matroid intersection, ddc:004, efficient polynomial-time approximation scheme, budgeted matching, Theory of computation

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.49

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets

Autoři: Ilan Doron-Arad and Ariel Kulik and Hadas Shachnai Doron-Arad, Ilan Kulik, Ariel a další

Témata: budgeted matching, budgeted matroid intersection, efficient polynomial-time approximation scheme, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.49
Is Part Of LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)