Approximation algorithms for bipartite matching with metric and geometric costs
From MaRDI portal
(Redirected from Publication:5259591)
Recommendations
- A near-linear time ε-approximation algorithm for geometric bipartite matching
- A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
- scientific article; zbMATH DE number 1305475
- A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings
- A near-linear constant-factor approximation for Euclidean bipartite matching?
Cites work
- Advances in Cryptology – CRYPTO 2004
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- Bounds on the sample complexity for private learning and private data release
- Characterizing the sample complexity of private learners
- Collusion-secure fingerprinting for digital data
- Differential privacy and the fat-shattering dimension of linear queries
- Efficient algorithms for privately releasing marginals via convex relaxations
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- scientific article; zbMATH DE number 5485440 (Why is no real title available?)
- scientific article; zbMATH DE number 5485574 (Why is no real title available?)
- Interactive privacy via the median mechanism
- Iterative Constructions and Private Data Release
- Lower bounds in differential privacy
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- On the complexity of differentially private data release, efficient algorithms and hardness results
- On the geometry of differential privacy
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Theory of Cryptography
Cited in
(22)- Approximate minimum weight matching on points in k-dimensional space
- On universally consistent and fully distribution-free rank tests of vector independence
- Optimal transport: discretization and algorithms
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
- scientific article; zbMATH DE number 6381629 (Why is no real title available?)
- Geometry Helps in Matching
- scientific article; zbMATH DE number 1305475 (Why is no real title available?)
- Geometry helps to compare persistence diagrams
- Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances
- Efficient algorithms for geometric partial matching
- Preconditioning for the Geometric Transportation Problem
- A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings
- A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
- Fast matching-based approximations for maximum duo-preservation string mapping and its weighted variant
- Bi-objective matchings with the triangle inequality
- A near-linear constant-factor approximation for Euclidean bipartite matching?
- A near-linear time ε-approximation algorithm for geometric bipartite matching
- Algorithms for the transportation problem in geometric settings
- Distribution-Free Consistent Independence Tests via Center-Outward Ranks and Signs
- Towards optimal running timesfor optimal transport
- Pitman efficiency lower bounds for multivariate distribution-free tests based on optimal transport
- An 0(n log n) algorithm for the convex bipartite matching problem
This page was built for publication: Approximation algorithms for bipartite matching with metric and geometric costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259591)
