Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Gorodezky, Igor"'
Autor:
Gorodezky, Igor
This thesis investigates dominating sets in Kneser graphs as well as a selection of other topics related to graph domination. Dominating sets in Kneser graphs, especially those of minimum size, often correspond to interesting combinatorial incidence
Externí odkaz:
http://hdl.handle.net/10012/3190
Autor:
Harsha, Prahladh, Charikar, Moses, Andrews, Matthew, Arora, Sanjeev, Khot, Subhash, Moshkovitz, Dana, Zhang, Lisa, Aazami, Ashkan, Desai, Dev, Gorodezky, Igor, Jagannathan, Geetha, Kulikov, Alexander S., Mir, Darakhshan J., Newman, Alantha, Nikolov, Aleksandar, Pritchard, David, Spencer, Gwen
These are the lecture notes for the DIMACS Tutorial "Limits of Approximation Algorithms: PCPs and Unique Games" held at the DIMACS Center, CoRE Building, Rutgers University on 20-21 July, 2009. This tutorial was jointly sponsored by the DIMACS Specia
Externí odkaz:
http://arxiv.org/abs/1002.3864
Autor:
Crewe, Albert, Gorodezky, Igor
Publikováno v:
In Optik - International Journal for Light and Electron Optics 2006 117(1):15-20
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Approximation, Randomization & Combinatorial Optimization. Algorithms & Techniques (9783642153686); 2010, p178-191, 14p
Autor:
Babai, László, Gorodezky, Igor
Publikováno v:
Proceedings of the Eighteenth Annual ACM-SIAM Symposium: Discrete Algorithms; 1/ 7/2007, p627-636, 10p
Publikováno v:
New Yorker; 5/26/2008, Vol. 84 Issue 15, p5-5, 2/3p