Geometry helps in bottleneck matching and related problems
From MaRDI portal
Publication:5946120
DOI10.1007/s00453-001-0016-8zbMath0980.68101OpenAlexW2052551455MaRDI QIDQ5946120
No author found.
Publication date: 4 March 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0016-8
Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)
Related Items (44)
Two optimization problems for unit disks ⋮ Minimum cuts in geometric intersection graphs ⋮ New variants of perfect non-crossing matchings ⋮ Improved Grid Map Layout by Point Set Matching ⋮ Efficient many-to-Many point matching in one dimension ⋮ On the parameterized complexity of \(d\)-dimensional point set pattern matching ⋮ AN APPROXIMATE MORPHING BETWEEN POLYLINES ⋮ Faster bottleneck non-crossing matchings of points in convex position ⋮ Parametric search made practical ⋮ Bipartite diameter and other measures under translation ⋮ Matching sets of line segments ⋮ Geometry Helps to Compare Persistence Diagrams ⋮ Convex transversals ⋮ New families of stable simplicial filtration functors ⋮ Maximum matchings in geometric intersection graphs ⋮ An algorithmic framework for the single source shortest path problem with applications to disk graphs ⋮ Barcodes as summary of loss function topology ⋮ Noisy colored point set matching ⋮ Bottleneck partial-matching Voronoi diagrams and applications ⋮ Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points ⋮ Approximating the bottleneck plane perfect matching of a point set ⋮ On the Stability of Multigraded Betti Numbers and Hilbert Functions ⋮ Bottleneck profiles and discrete Prokhorov metrics for persistence diagrams ⋮ Approximate one-to-one point pattern matching ⋮ FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS ⋮ Hausdorff matching and Lipschitz optimization ⋮ New variants of perfect non-crossing matchings ⋮ Bounded-angle spanning tree: modeling networks with angular constraints ⋮ Structural properties of bichromatic non-crossing matchings ⋮ Natural pseudo-distance and optimal matching between reduced size functions ⋮ TURNING SHAPE DECISION PROBLEMS INTO MEASURES ⋮ Bottleneck flows in unit capacity networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch ⋮ A persistence landscapes toolbox for topological statistics ⋮ Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle ⋮ Aggregation error for location models: Survey and analysis ⋮ A functorial Dowker theorem and persistent homology of asymmetric networks ⋮ Monochromatic plane matchings in bicolored point set ⋮ Finding Largest Common Point Sets ⋮ Shortest paths in intersection graphs of unit disks ⋮ Optimal point movement for covering circular regions
This page was built for publication: Geometry helps in bottleneck matching and related problems
