Euclidean maximum matchings in the plane -- local to global
type: Item
instance of: scholarly article
title: Euclidean maximum matchings in the plane -- local to global
DOI: 10.1007/978-3-030-83508-8_14
author: Ahmad Biniaz
author: Anil Maheshwari
author: Michiel Smid
publication date: 2022-03-25T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7498677
zbMATH Keywords: planar points
zbMATH Keywords: maximum matching
zbMATH Keywords: global maximum
zbMATH Keywords: local maximum
zbMATH Keywords: pairwise crossing matching
zbMATH Keywords: pairwise intersecting disks
MaRDI profile type: Publication
full work available at URL: 978-3-030-83508-8 14
OpenAlex ID: W3190359733
cites work: Q4327375
cites work: On local search for weighted \(k\)-set packing
cites work: A survey of heuristics for the weighted matching problem
cites work: Maximum plane trees in multipartite geometric graphs
cites work: Q3029701
cites work: Linear-Time Approximation for Maximum Weight Matching
cites work: Long non-crossing configurations in the plane
cites work: Partitioning heuristics for two geometric maximization problems
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Paths, Trees, and Flowers
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Q3138921
cites work: Data Structures for Weighted Matching and Extensions to b -matching and f -factors
cites work: An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time
cites work: Stabbing pairwise intersecting disks by five points
cites work: Matching points with disks with a common intersection
cites work: Q5519710
cites work: Q5519711
cites work: Q3048571
cites work: Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
cites work: Multicommodity flows in planar graphs
cites work: On the Euclidean assignment problem
cites work: Q3738164
cites work: A linear-time algorithm for edge-disjoint paths in planar graphs
description: scientific article; zbMATH DE number 7498677