5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.DS2012★ 5 cited
On Mimicking Networks Representing Minimum Terminal Cuts
Arindam Khan, Prasad Raghavendra, Prasad Tetali +1
Given a capacitated undirected graph with a set of terminals , a mimicking network is a smaller graph that exactly preserves all the minimum cu…
cs.GT2012
LP-based Covering Games with Low Price of Anarchy
Georgios Piliouras, Tomas Valla, Laszlo A. Vegh
We present a new class of vertex cover and set cover games. The price of anarchy bounds match the best known constant factor approximation guarantees for the centralized optimizati…