English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number

MPS-Authors
/persons/resource/persons263365

Akrami,  Hannaneh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Akrami, H., Alon, N., Ray Chaudhury, B., Garg, J., Mehlhorn, K., & Mehta, R. (2023). EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number. In EC 2023 (pp. 61-61). New York, NY: ACM.


Cite as: https://hdl.handle.net/21.11116/0000-000F-1437-D
Abstract
There is no abstract available