1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
Online Coloring and a New Type of Adversary for Online Graph Problems
Yaqiao Li, Vishnu V. Narayan, Denis Pankratov
We introduce a new type of adversary for online graph problems. The new adversary is parameterized by a single integer , which upper bounds the number of connected components th…
cs.DS2018
The Matching Augmentation Problem: A -Approximation Algorithm
Joe Cheriyan, Jack Dippel, Fabrizio Grandoni +2
We present a approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that the edges of cost ze…