Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Min-max graph partitioning and small set expansion

Autor: Bansal, N., Feige, U., Krauthgamer, R., Makarychev, K., Magarajan, V., Naor, J., Schwartz, R., Ostrovsky, R.

Publikováno v: SIAM Journal on Computing, 43(2), 872-904. Society for Industrial and Applied Mathematics (SIAM)
Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011, Palm Springs CA, USA, October 22-25, 2011), 17-26
STARTPAGE=17;ENDPAGE=26;TITLE=Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011, Palm Springs CA, USA, October 22-25, 2011)
FOCS

We study graph partitioning problems from a min-max perspective, in which an input graph on n vertices should be partitioned into k parts, and the objective is to minimize the maximum number of edges leaving a single part. The two main versions we co

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3d2881b8ad07db0fa17040f460367c8
https://doi.org/10.1109/focs.2011.79

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

The Grothendieck Constant is Strictly Smaller than Krivine's Bound.

Autor: Braverman, M., Makarychev, K., Makarychev, Y., Naor, A.

Publikováno v: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS); 2011, p453-462, 10p

Optimizing Large-Scale Graph Analysis on a Multi-threaded, Multi-core Platform.

Autor: Guojing Cong, Makarychev, K.

Publikováno v: 2011 IEEE International Parallel & Distributed Processing Symposium (IPDPS); 2011, p688-697, 10p