3 papers
cs.DS2020
Minmax Regret for sink location on paths with general capacities
Mordecai Golin, Sai Sandeep
In dynamic flow networks, every vertex starts with items (flow) that need to be shipped to designated sinks. All edges have two associated quantities: length, the amount of time re…
cs.DS2019
PERMUTATION Strikes Back: The Power of Recourse in Online Metric Matching
Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep
In the classical Online Metric Matching problem, we are given a metric space with servers. A collection of clients arrive in an online fashion, and upon arrival, a client shoul…
cs.LO2017
On Petri Nets with Hierarchical Special Arcs
S. Akshay, Supratik Chakraborty, Ankush Das +2
We investigate the decidability of termination, reachability, coverability and deadlock-freeness of Petri nets endowed with a hierarchy on places, and with inhibitor arcs, reset ar…