4 papers
Heuristic algorithms for the stochastic critical node detection problem
Tuguldur Bayarsaikhan, Altannar Chinchuluun, Ashwin Arulselvan +1
Given a network, the critical node detection problem finds a subset of nodes whose removal disrupts the network connectivity. Since many real-world systems are naturally modeled as…
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 …
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…
A proof for Padberg's conjecture on rank of matching polytope
Ashwin Arulselvan, Daniel Karch
Padberg introduced a geometric notion of ranks for (mixed) integer rational polyhedrons and conjectured that the geometric rank of the matching polytope is one. In this work, we pr…