Computing fair and bottleneck matchings in geometric graphs
From MaRDI portal
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)
Recommendations
Cites work
- Algorithms for two bottleneck optimization problems
- Almost tight upper bounds for lower envelopes in higher dimensions
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions
- Generalized approximate algorithms for point set congruence
- Generalized Selection and Ranking: Sorted Matrices
- Geometric pattern matching in d-dimensional space
- Geometry Helps in Matching
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3989103 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Improvements on geometric pattern matching problems
- Minimum deviation problems
- New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
- On finding most uniform spanning trees
- Relative neighborhood graphs in three dimensions
- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
Cited in
(10)- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
- Computing Euclidean bottleneck matchings in higher dimensions
- On bipartite matchings of minimum density
- scientific article; zbMATH DE number 1431747 (Why is no real title available?)
- Many-to-One Stable Matching: Geometry and Fairness
- Geometry helps in bottleneck matching and related problems
- New variants of perfect non-crossing matchings
- New variants of perfect non-crossing matchings
- Approximating the bottleneck plane perfect matching of a point set
- Cache-oblivious selection in sorted \(X+Y\) matrices
This page was built for publication: Computing fair and bottleneck matchings in geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487431)
