Local search algorithms for the maximum carpool matching problem
DOI10.4230/LIPICS.ESA.2017.55zbMATH Open1442.68267MaRDI QIDQ5111744FDOQ5111744
Authors: Gilad Kutiel, Dror Rawitz
Publication date: 27 May 2020
Recommendations
- Local search algorithms for the maximum carpool matching problem
- Approximation algorithms for the maximum carpool matching problem
- Carpooling in social networks
- Approximate ridesharing of personal vehicles problem
- The optimality of the online greedy algorithm in carpool and chairman assignment problems
Directed graphs (digraphs), tournaments (05C20) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)
Cites Work
- Optimization for dynamic ride-sharing: a review
- Scalability issues in optimal assignment for carpooling
- Improved approximation algorithms for the spanning star forest problem
- An Improved Approximation Bound for Spanning Star Forest and Color Saving
- Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
- On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP
- Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
- Deterministic Algorithms for Submodular Maximization Problems
- Approximation algorithms for the maximum carpool matching problem
- Greedy local improvement and weighted set packing approximation
- Improved Approximation Algorithms for Weighted 2-Path Partitions
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
Cited In (1)
This page was built for publication: Local search algorithms for the maximum carpool matching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111744)