Approximation algorithms for the maximum carpool matching problem (Q2399375): Difference between revisions

@@ Property / OpenAlex ID @@
+W2340469429
@@ Property / OpenAlex ID: W2340469429 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05609
@@ Property / arXiv ID: 1604.05609 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization for dynamic ride-sharing: a review
@@ Property / cites work: Optimization for dynamic ride-sharing: a review / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for the Spanning Star Forest Problem
+Normal rank
@@ Property / cites work @@
+Scalability issues in optimal assignment for carpooling
+Normal rank
@@ Property / cites work @@
+Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
+Normal rank
@@ Property / cites work @@
+A strongly polynomial minimum cost circulation algorithm
+Normal rank