5 citations · 8 across the 2 of their papers we have counts for
3 papers · 1 filter
How to Secure Matchings Against Edge Failures
Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
Suppose we are given a bipartite graph that admits a perfect matching and an adversary may delete any edge from the graph with the intention of destroying all perfect matchings. We…
Robust Assignments with Vulnerable Nodes
David Adjiashvili, Viktor Bindewald, Dennis Michaels
Various real-life planning problems require making upfront decisions before all parameters of the problem have been disclosed. An important special case of such problem especially…
Robust Assignments via Ear Decompositions and Randomized Rounding
David Adjiashvili, Viktor Bindewald, Dennis Michaels
Many real-life planning problems require making a priori decisions before all parameters of the problem have been revealed. An important special case of such problem arises in sche…