No label defined (Q5088980)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7559248

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7559248

Statements

scholarly article

0 references

10.4230/LIPIcs.SoCG.2019.48

0 references

Nathaniel Adam Lahn

0 references

Sharath Raghvendra

0 references

publication date

18 July 2022

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

bipartite matching

0 references

bottleneck matching

0 references

MaRDI profile type

MaRDI publication profile

0 references

A near-linear constant-factor approximation for euclidean bipartite matching?

0 references

0 references

Approximation algorithms for bipartite matching with metric and geometric costs

0 references

0 references

Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time

0 references

Geometry helps in bottleneck matching and related problems

0 references

A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem

0 references

Faster Scaling Algorithms for Network Problems

0 references

The Weighted Matching Approach to Maximum Cardinality Matching

0 references

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

0 references

0 references

A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs

0 references

Algorithms – ESA 2004

0 references

A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates

0 references

A near-linear time ε-approximation algorithm for geometric bipartite matching

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5088980

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5088980&oldid=36831129"