scientific article; zbMATH DE number 7559248
From MaRDI portal
Publication:5088980
DOI10.4230/LIPIcs.SoCG.2019.48MaRDI QIDQ5088980
Sharath Raghvendra, Nathaniel Adam Lahn
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
- The Weighted Matching Approach to Maximum Cardinality Matching
- Faster Scaling Algorithms for Network Problems
- A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
- A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs
- Approximation algorithms for bipartite matching with metric and geometric costs
- A near-linear constant-factor approximation for euclidean bipartite matching?
- A near-linear time ε-approximation algorithm for geometric bipartite matching
- Algorithms – ESA 2004
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Geometry helps in bottleneck matching and related problems
