Výsledky vyhledávání - "Nathaniel Lahn"

A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs

Autor: Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra, Mudabir Kabir Asathulla

Publikováno v: ACM Transactions on Algorithms. 16:1-30

Given a weighted planar bipartite graph G ( A ∪ B , E ) where each edge has an integer edge cost, we give an Õ( n 4/3 log nC ) time algorithm to compute minimum-cost perfect matching; here C is the maximum edge cost in the graph. The previous best

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9c920cb17f1c61aef7917acfb2d480ba
https://doi.org/10.1145/3365006

Zobrazit plný text záznamu

An O(n5/4) Time ∊-Approximation Algorithm for RMS Matching in a Plane

Autor: Nathaniel Lahn, Sharath Raghvendra

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::99270c05a37003dabbee1b7992851861
https://doi.org/10.1137/1.9781611976465.55

Zobrazit plný text záznamu

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

Autor: Nathaniel Lahn, Sharath Raghvendra

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c197e34d3915d5ba8b94800e9b2a0ffb
https://doi.org/10.1137/1.9781611975482.36

Zobrazit plný text záznamu

A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs

Autor: Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::64bfc7904edf49ce4eb347996f2583c2
https://doi.org/10.1137/1.9781611975031.31

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání