#### Filter Results:

- Full text PDF available (31)

#### Publication Year

2004

2018

- This year (3)
- Last 5 years (42)
- Last 10 years (70)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We prove strong lower bounds on integrality gaps of Sherali-Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali-Adams relaxationsâ€¦ (More)

Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to distinguish betweenâ€¦ (More)

- Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor
- STOC
- 2005

We introduce a new graph parameter, called the <i>Grothendieck constant</i> of a graph <i>G</i>=(<i>V,E</i>), which is defined as the least constant <i>K</i> such that for everyâ€¦ (More)

In this paper we present approximation algorithms for the maximum constraint satisfaction problem with <i>k</i> variables in each constraint (MAX <i>k</i>-CSP).
Given a (1 - Îµ) satisfiable 2CSP ourâ€¦ (More)

- Eden ChlamtÃ¡c, Konstantin Makarychev, Yury Makarychev
- 2006 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

In this paper we present a new approximation algorithm for unique games. For a unique game with n vertices and k states (labels), if a (1 - epsiv) fraction of all constraints is satisfiable, theâ€¦ (More)

We give O(âˆšlog n)-approximation algorithms for the MIN UNCUT, MIN 2CNF DELETION, DIRECTED BALANCED SEPERATOR, and DIRECTED SPARSEST CUT problems. The previously best known algorithms give an O(logâ€¦ (More)

- Virajith Jalaparti, Peter BodÃk, Ishai Menache, Sriram Rao, Konstantin Makarychev, Matthew Caesar
- Computer Communication Review
- 2015

- Nikhil Bansal, Uriel Feige, +4 authors Roy Schwartz
- 2011 IEEE 52nd Annual Symposium on Foundations ofâ€¦
- 2011

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â€¦ (More)

- Amol Ghoting, Konstantin Makarychev
- SIGMOD Conference
- 2009

Over the past three decades, the suffix tree has served as a fundamental data structure in string processing. However, its widespread applicability has been hindered due to the fact that suffix treeâ€¦ (More)

- Amol Ghoting, Konstantin Makarychev
- Proceedings of the Conference on High Performanceâ€¦
- 2009

With advances in sequencing technology and through aggressive sequencing efforts, DNA sequence data sets have been growing at a rapid pace. To gain from these advances, it is important to provideâ€¦ (More)