Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs

From MaRDI portal

Revision as of 00:51, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5383977

Jump to:navigation, search

DOI10.1137/1.9781611973402.18zbMath1422.68277arXiv1307.4355OpenAlexW1613953984MaRDI QIDQ5383977

Kook Jin Ahn, Sudipto Guha

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.4355

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Dynamic algorithms via the primal-dual method

This page was built for publication: Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5383977&oldid=20102855"