In this thesis we prove intractability results for several well studied problems in combinatorial optimization.
Closest Vector Problem with Pre-processing (CVPP): We show that the pre-processing version of the well known CLOSEST VECTOR PROBLEM is hard to approximate to an almost polynomial factor unless NP is in quasi polynomial time. The approximability of CVPP is closely related to the security of lattice based cryptosystems.
Pricing Loss Leaders: We show hardness of approximation results for the problem of maximizing profit from buyers with single minded valuations where each buyer is interested in bundles of at most k items, and the items are allowed to have negative prices ("Loss Leaders"). For k = 2, we show that assuming the UNIQUE GAMES CONJECTURE, it is hard to approximate the profit to any constant factor. For k ≥ 2, we show the same result assuming P ≠ NP.
Integrality gaps: We show Semi-Definite Programming (SDP) integrality gaps for UNIQUE GAMES and 2-to-1 GAMES. Inapproximability results for these problems imply inapproximability results for many fundamental optimization problems. For the first problem, we show "approximate" integrality gaps for super constant rounds of the powerful Lasserre hierarchy. For the second problem we show integrality gaps for the basic SDP relaxation with perfect completeness.
|Commitee:||Cole, Richard, Naor, Assaf, Regev, Oded, Spencer, Joel|
|School:||New York University|
|School Location:||United States -- New York|
|Source:||DAI-B 74/12(E), Dissertation Abstracts International|
|Subjects:||Applied Mathematics, Computer science|
|Keywords:||Closest vector problem, Hardness of approximation, Integrality gaps, Loss leaders, Probabilistically checkable proofs (pcp), Unique games conjecture|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be