Minimum cost perfect matching with delays for two sources

From MaRDI portal
(Redirected from Minimum cost perfect matching with delays for two sources)
Minimum cost perfect matching with delays for two sources (scientific article; zbMATH DE number 6751063)

DOI10.1007/978-3-319-57586-5_18MaRDI QIDQ5283368zbMATH OpenOpenAlexFDO

Authors Yuval Emek, Yaacov Shapiro, Yuyi Wang

Publication date 21 July 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-57586-5_18


Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)





Recommendations


Cites work


Cited in
(9)








This page was built for publication: Minimum cost perfect matching with delays for two sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283368)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Minimum_cost_perfect_matching_with_delays_for_two_sources_(scientific_article;_zbMATH_DE_number_6751063)&oldid=94597820"
Powered by MediaWiki