Geometry helps in bottleneck matching and related problems
From MaRDI portal
(Redirected from Publication:5946120)
Recommendations
- Computing fair and bottleneck matchings in geometric graphs
- Approximate congruence in nearly linear time
- Bottleneck partial-matching Voronoi diagrams and applications
- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
- Bottleneck partial-matching Voronoi diagrams and applications
Cited in
(59)- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
- scientific article; zbMATH DE number 7559248 (Why is no real title available?)
- Hausdorff matching and Lipschitz optimization
- Minimum cuts in geometric intersection graphs
- New variants of perfect non-crossing matchings
- Natural pseudo-distance and optimal matching between reduced size functions
- Bottleneck partial-matching Voronoi diagrams and applications
- Bottleneck flows in unit capacity networks
- Bottleneck partial-matching Voronoi diagrams and applications
- TURNING SHAPE DECISION PROBLEMS INTO MEASURES
- Computing fair and bottleneck matchings in geometric graphs
- Monochromatic plane matchings in bicolored point set
- Shortest paths in intersection graphs of unit disks
- scientific article; zbMATH DE number 7559117 (Why is no real title available?)
- Geometry helps to compare persistence diagrams
- Matching convex shapes with respect to the symmetric difference
- Structural properties of bichromatic non-crossing matchings
- Approximate one-to-one point pattern matching
- A functorial Dowker theorem and persistent homology of asymmetric networks
- Faster bottleneck non-crossing matchings of points in convex position
- New variants of perfect non-crossing matchings
- scientific article; zbMATH DE number 7559246 (Why is no real title available?)
- FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS
- Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points
- Translating Hausdorff is hard: fine-grained lower bounds for Hausdorff distance under translation
- Sketching persistence diagrams
- Matching sets of line segments
- Matching sets of line segments
- scientific article; zbMATH DE number 3945343 (Why is no real title available?)
- Computing the minimum bottleneck moving spanning tree
- Matching nuts and bolts faster
- Noisy colored point set matching
- Approximating the bottleneck plane perfect matching of a point set
- Improved Grid Map Layout by Point Set Matching
- On the Stability of Multigraded Betti Numbers and Hilbert Functions
- Bottleneck profiles and discrete Prokhorov metrics for persistence diagrams
- Finding Largest Common Point Sets
- Aggregation error for location models: Survey and analysis
- Bipartite diameter and other measures under translation
- AN APPROXIMATE MORPHING BETWEEN POLYLINES
- Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
- Bottleneck matching in the plane
- Maximum matchings in geometric intersection graphs
- A persistence landscapes toolbox for topological statistics
- Computing Euclidean bottleneck matchings in higher dimensions
- Computing diameter+2 in truly-subquadratic time for unit-disk graphs
- Geometric matching and bottleneck problems
- New families of stable simplicial filtration functors
- Parametric search made practical
- An algorithmic framework for the single source shortest path problem with applications to disk graphs
- Bounded-angle spanning tree: modeling networks with angular constraints
- On the parameterized complexity of \(d\)-dimensional point set pattern matching
- Approximate congruence in nearly linear time
- Two optimization problems for unit disks
- Barcodes as summary of loss function topology
- On computing a center persistence diagram
- Efficient many-to-Many point matching in one dimension
- Convex transversals
This page was built for publication: Geometry helps in bottleneck matching and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946120)
