scientific article; zbMATH DE number 7559206
From MaRDI portal
Publication:5088931
DOI10.4230/LIPIcs.SoCG.2019.6MaRDI QIDQ5088931
Hsien-Chih Chang, Allen Xiao, Pankaj K. Agarwal
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1903.09358
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A strongly polynomial minimum cost circulation algorithm
- Minimum-cost flows in unit-capacity networks
- Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
- Geometry Helps in Matching
- Network Flow and Testing Graph Connectivity
- Scaling Algorithms for Weighted Matching in General Graphs
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Faster Scaling Algorithms for Network Problems
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A near-linear constant-factor approximation for euclidean bipartite matching?
- A near-linear time ε-approximation algorithm for geometric bipartite matching
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication:
