Theory and Practice in Large Carpooling Problems
Copyright policy )Theory and Practice in Large Carpooling Problems
AbstractWe address the carpooling problem as a graph-theoretic problem. If the set of drivers is known in advance, then for any car capacity, the problem is equivalent to the assignment problem in bipartite graphs. Otherwise, when we do not know in advance who will drive their vehicle and who will be a passenger, the problem is NP-hard. We devise and implement quick heuristics for both cases, based on graph algorithms, as well as parallel algorithms based on geometric/algebraic approach. We compare between the algorithms on random graphs, as well as on real, very large, data.
- University of Haifa Israel
- Hasselt University Belgium
Carpooling, Maximum Weighted Matching, Scalability, Incremental Algorithms, Star Partition Problem, Linear Programming, Gradient Projection Algorithm
Carpooling, Maximum Weighted Matching, Scalability, Incremental Algorithms, Star Partition Problem, Linear Programming, Gradient Projection Algorithm
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).25 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!