2 papers
cs.DS2016
Algorithmic and Hardness Results for the Hub Labeling Problem
Haris Angelidakis, Yury Makarychev, Vsevolod Oparin
There has been significant success in designing highly efficient algorithms for distance and shortest-path queries in recent years; many of the state-of-the-art algorithms use the…
cs.CC2014
Tree-like resolution complexity of two planar problems
Dmitry Itsykson, Anna Malova, Vsevolod Oparin +1
We consider two CSP problems: the first CSP encodes 2D Sperner's lemma for the standard triangulation of the right triangle on small triangles; the second CSP encodes the fac…