Max-min greedy matching problem: hardness for the adversary and fractional variant
From MaRDI portal
Publication:6138832
Recommendations
Cites work
- scientific article; zbMATH DE number 5764830 (Why is no real title available?)
- scientific article; zbMATH DE number 6850371 (Why is no real title available?)
- An Experimental Study of Algorithms for Online Bipartite Matching
- Combinatorial auctions via posted prices
- Edge Dominating Sets in Graphs
- Graph expansion and the unique games conjecture
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis
- Max-min greedy matching
- Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
- Online bipartite matching with unknown distributions
- Online matching and ad allocation
- Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
- Tight approximation ratio for Minimum Maximal Matching
This page was built for publication: Max-min greedy matching problem: hardness for the adversary and fractional variant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138832)