Two dimensional maximum weight matching using Manhattan topology

DOI10.1016/j.orl.2022.02.008OpenAlexW4214915080MaRDI QIDQ2157895

Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern, Nili Guttmann-Beck

Publication date: 22 July 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2022.02.008

zbMATH Keywords

maximum weight matchingManhattan topologypoints in a plane

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Constructing a perfect matching is in random NC
• Approximation algorithms for maximum dispersion
• Algorithmic Applications of Baur-Strassen’s Theorem
• Linear-Time Approximation for Maximum Weight Matching
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
• Faster scaling algorithms for general graph matching problems
• Maximum matching and a polyhedron with 0,1-vertices
• Combinatorial optimization. Theory and algorithms

This page was built for publication: Two dimensional maximum weight matching using Manhattan topology