Approximation algorithms for bipartite matching with metric and geometric costs
DOI10.1145/2591796.2591844zbMATH Open1315.05104OpenAlexW2079168081MaRDI QIDQ5259591FDOQ5259591
Authors: R. Sharathkumar, Pankaj K. Agarwal 
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2591796.2591844
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?
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Theory of Cryptography
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower bounds in differential privacy
- Iterative Constructions and Private Data Release
- Differential privacy and the fat-shattering dimension of linear queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- On the complexity of differentially private data release, efficient algorithms and hardness results
- Title not available (Why is that?)
- Collusion-secure fingerprinting for digital data
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Bounds on the sample complexity for private learning and private data release
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- Characterizing the sample complexity of private learners
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Efficient algorithms for privately releasing marginals via convex relaxations
Cited In (19)
- Towards optimal running timesfor optimal transport
- Title not available (Why is that?)
- Optimal transport: discretization and algorithms
- An 0(n log n) algorithm for the convex bipartite matching problem
- A near-linear constant-factor approximation for Euclidean bipartite matching?
- Approximate minimum weight matching on points in k-dimensional space
- Algorithms for the transportation problem in geometric settings
- Geometry helps to compare persistence diagrams
- Title not available (Why is that?)
- A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
- A near-linear time ε-approximation algorithm for geometric bipartite matching
- Fast matching-based approximations for maximum duo-preservation string mapping and its weighted variant
- Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances
- Bi-objective matchings with the triangle inequality
- Geometry Helps in Matching
- Distribution-Free Consistent Independence Tests via Center-Outward Ranks and Signs
- On universally consistent and fully distribution-free rank tests of vector independence
- Preconditioning for the Geometric Transportation Problem
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
Uses Software
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)
