[PDF][PDF] On the unique games conjecture
S Khot, NK Vishnoi - FOCS, 2005 - scholar.archive.org
On the Unique Games Conjecture Page 1 On the Unique Games Conjecture Subhash Khot
Courant Institute of Mathematical Sciences, NYU ∗ Abstract This article surveys recently …
Courant Institute of Mathematical Sciences, NYU ∗ Abstract This article surveys recently …
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ1
SA Khot, NK Vishnoi - Journal of the ACM (JACM), 2015 - dl.acm.org
In this article, we disprove a conjecture of Goemans and Linial; namely, that every negative
type metric embeds into ℓ1 with constant distortion. We show that for an arbitrarily small …
type metric embeds into ℓ1 with constant distortion. We show that for an arbitrarily small …
Designing the distribution network of essential items in the critical conditions of earthquakes and COVID-19 simultaneously
Current societies must make the necessary plans for effective responses and to reduce the
destructive effects of disasters. For this reason, this research has developed a mathematical …
destructive effects of disasters. For this reason, this research has developed a mathematical …
Echocardiography image segmentation: A survey
Segmentation is an important step in medical imaging to acquire qualitative measurements
such as the location of the desired objects and also for quantitative measurements such as …
such as the location of the desired objects and also for quantitative measurements such as …
Vertical perimeter versus horizontal perimeter
A Naor, R Young - Annals of Mathematics, 2018 - JSTOR
Given k∊ ℕ, the k'th discrete Heisenberg group, denoted ℍ ℤ 2 k+ 1, is the group generated
by the elements a 1, b 1,…, ak, bk, c, subject to the commutator relations a 1, b 1=···= ak, bk …
by the elements a 1, b 1,…, ak, bk, c, subject to the commutator relations a 1, b 1=···= ak, bk …
Min-max graph partitioning and small set expansion
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 …
on n vertices should be partitioned into k parts, and the objective is to minimize the …
Inapproximability of combinatorial optimization problems
L Trevisan - … of Combinatorial Optimization: Problems and New …, 2014 - Wiley Online Library
This chapter focuses on approximation algorithms, which are algorithms of the second kind
with a provably good worst‐case ratio between the value of the solution found by the …
with a provably good worst‐case ratio between the value of the solution found by the …
Metric dimension reduction: a snapshot of the Ribe program
A Naor - Proceedings of the International Congress of …, 2018 - World Scientific
Proceedings of the International Congress of Mathematicians (ICM 2018) : METRIC
DIMENSION REDUCTION: A SNAPSHOT OF THE RIBE PROG Page 1 PRoc. INT. CoNG …
DIMENSION REDUCTION: A SNAPSHOT OF THE RIBE PROG Page 1 PRoc. INT. CoNG …
Differentiating maps into L ¹, and the geometry of BV functions
J Cheeger, B Kleiner - Annals of mathematics, 2010 - JSTOR
This is one of a series of papers examining the interplay between differentiation theory for
Lipschitz maps X→ V and bi-Lipschitz nonembeddability, where X is a metric measure …
Lipschitz maps X→ V and bi-Lipschitz nonembeddability, where X is a metric measure …
Improved Lower Bounds for Embeddings into
R Krauthgamer, Y Rabani - SIAM Journal on Computing, 2009 - SIAM
We improve upon recent lower bounds on the minimum distortion of embedding certain finite
metric spaces into L_1. In particular, we show that for every n\ge1, there is an n-point metric …
metric spaces into L_1. In particular, we show that for every n\ge1, there is an n-point metric …