Approximation algorithms for the maximum carpool matching problem
From MaRDI portal
Publication:2399375
DOI10.1007/978-3-319-58747-9_19zbMath1442.68266arXiv1604.05609OpenAlexW2340469429MaRDI QIDQ2399375
Publication date: 22 August 2017
Full work available at URL: https://arxiv.org/abs/1604.05609
Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20) Matching models (91B68)
Related Items (3)
Complexity and approximability of extended spanning star forest problems in general and complete graphs ⋮ Local search algorithms for the maximum carpool matching problem ⋮ Unnamed Item
Cites Work
- A strongly polynomial minimum cost circulation algorithm
- Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
- Optimization for dynamic ride-sharing: a review
- Scalability issues in optimal assignment for carpooling
- Improved Approximation Algorithms for the Spanning Star Forest Problem
- Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
This page was built for publication: Approximation algorithms for the maximum carpool matching problem
