Dissertation/Thesis Abstract

Inapproximability Reductions and Integrality Gaps
by Popat, Preyas, Ph.D., New York University, 2013, 157; 3591337
Abstract (Summary)

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.

Indexing (document details)
Advisor: Khot, Subhash
Commitee: Cole, Richard, Naor, Assaf, Regev, Oded, Spencer, Joel
School: New York University
Department: Computer Science
School Location: United States -- New York
Source: DAI-B 74/12(E), Dissertation Abstracts International
Source Type: DISSERTATION
Subjects: Applied Mathematics, Computer science
Keywords: Closest vector problem, Hardness of approximation, Integrality gaps, Loss leaders, Probabilistically checkable proofs (pcp), Unique games conjecture
Publication Number: 3591337
ISBN: 9781303319013
Copyright © 2019 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest