Showing 2014Show all
2 papers · 1 filter
cs.DM2014
Matchings with lower quotas: Algorithms and complexity
Ashwin Arulselvan, Ágnes Cseh, Martin Groß +2
We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph with weights on the edges in …
cs.DS2014
Graph Orientation and Flows Over Time
Ashwin Arulselvan, Martin Groß, Martin Skutella
Flows over time are used to model many real-world logistic and routing problems. The networks underlying such problems -- streets, tracks, etc. -- are inherently undirected and dir…