Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Erratum to: ``Greedy matching: guarantees and limitations

From MaRDI portal
Publication:1702135
Jump to:navigation, search

DOI10.1007/s00453-017-0281-9zbMath1381.68304OpenAlexW2592989345MaRDI QIDQ1702135

Bert Besser, Matthias Poloczek

Publication date: 28 February 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-017-0281-9



Mathematics Subject Classification ID

Approximation algorithms (68W25) Randomized algorithms (68W20)


Related Items (2)

On extensions of the deterministic online model for bipartite matching and max-sat ⋮ On conceptually simple algorithms for variants of online bipartite matching




Cites Work

  • Greedy matching: guarantees and limitations
  • Randomized priority algorithms
  • Priority algorithms for graph optimization problems
  • (Incremental) priority algorithms




This page was built for publication: Erratum to: ``Greedy matching: guarantees and limitations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1702135&oldid=14024164"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 06:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki