Matches in SemOpenAlex for { <https://semopenalex.org/work/W4287777399> ?p ?o ?g. }
Showing items 1 to 65 of
65
with 100 items per page.
- W4287777399 abstract "The UNIQUE GAMES problem is a central problem in algorithms and complexity theory. Given an instance of UNIQUE GAMES, the STRONG UNIQUE GAMES problem asks to find the largest subset of vertices, such that the UNIQUE GAMES instance induced on them is completely satisfiable. In this paper, we give new algorithmic and hardness results for STRONG UNIQUE GAMES. Given an instance with label set size $k$ where a set of $(1 - epsilon)$-fraction of the vertices induce an instance that is completely satisfiable, our first algorithm produces a set of $1 - widetilde{O}({k^2}) epsilon sqrt{log n}$ fraction of the vertices such that the UNIQUE GAMES induced on them is completely satisfiable. In the same setting, our second algorithm produces a set of $1 - widetilde{O}({k^2}) sqrt{epsilon log d}$ (here $d$ is the largest vertex degree of the graph) fraction of the vertices such that the UNIQUE GAMES induced on them is completely satisfiable. The technical core of our results is a new connection between STRONG UNIQUE GAMES and Small-Set-Vertex-Expansion in graphs. Complementing this, assuming the Unique Games Conjecture, we prove that it is NP-hard to compute a set of size larger than $1 - Omega( sqrt{epsilon log k log d})$ for which all the constraints induced on this set are satisfied. Given an undirected graph $G(V,E)$ the ODD CYCLE TRANSVERSAL problem asks to delete the least fraction of vertices to make the induced graph on the remaining vertices bipartite. As a corollary to our main algorithmic results, we obtain an algorithm that outputs a set $S$ such the graph induced on $V setminus S$ is bipartite, and $|S|/n leq O(sqrt{epsilon log d})$ (here $d$ is the largest vertex degree and $epsilon$ is the optimal fraction of vertices that need to be deleted). Assuming the Unique Games Conjecture, we prove a matching (up to constant factors) hardness." @default.
- W4287777399 created "2022-07-26" @default.
- W4287777399 creator A5059653613 @default.
- W4287777399 creator A5082860877 @default.
- W4287777399 date "2020-05-18" @default.
- W4287777399 modified "2023-09-25" @default.
- W4287777399 title "Approximation Algorithms and Hardness for Strong Unique Games" @default.
- W4287777399 doi "https://doi.org/10.48550/arxiv.2005.08918" @default.
- W4287777399 hasPublicationYear "2020" @default.
- W4287777399 type Work @default.
- W4287777399 citedByCount "0" @default.
- W4287777399 crossrefType "posted-content" @default.
- W4287777399 hasAuthorship W4287777399A5059653613 @default.
- W4287777399 hasAuthorship W4287777399A5082860877 @default.
- W4287777399 hasBestOaLocation W42877773991 @default.
- W4287777399 hasConcept C112955886 @default.
- W4287777399 hasConcept C114614502 @default.
- W4287777399 hasConcept C118615104 @default.
- W4287777399 hasConcept C121332964 @default.
- W4287777399 hasConcept C122818955 @default.
- W4287777399 hasConcept C132525143 @default.
- W4287777399 hasConcept C148764684 @default.
- W4287777399 hasConcept C149629883 @default.
- W4287777399 hasConcept C178790620 @default.
- W4287777399 hasConcept C185592680 @default.
- W4287777399 hasConcept C197657726 @default.
- W4287777399 hasConcept C2779557605 @default.
- W4287777399 hasConcept C2780012671 @default.
- W4287777399 hasConcept C2780990831 @default.
- W4287777399 hasConcept C33923547 @default.
- W4287777399 hasConcept C62520636 @default.
- W4287777399 hasConcept C80899671 @default.
- W4287777399 hasConceptScore W4287777399C112955886 @default.
- W4287777399 hasConceptScore W4287777399C114614502 @default.
- W4287777399 hasConceptScore W4287777399C118615104 @default.
- W4287777399 hasConceptScore W4287777399C121332964 @default.
- W4287777399 hasConceptScore W4287777399C122818955 @default.
- W4287777399 hasConceptScore W4287777399C132525143 @default.
- W4287777399 hasConceptScore W4287777399C148764684 @default.
- W4287777399 hasConceptScore W4287777399C149629883 @default.
- W4287777399 hasConceptScore W4287777399C178790620 @default.
- W4287777399 hasConceptScore W4287777399C185592680 @default.
- W4287777399 hasConceptScore W4287777399C197657726 @default.
- W4287777399 hasConceptScore W4287777399C2779557605 @default.
- W4287777399 hasConceptScore W4287777399C2780012671 @default.
- W4287777399 hasConceptScore W4287777399C2780990831 @default.
- W4287777399 hasConceptScore W4287777399C33923547 @default.
- W4287777399 hasConceptScore W4287777399C62520636 @default.
- W4287777399 hasConceptScore W4287777399C80899671 @default.
- W4287777399 hasLocation W42877773991 @default.
- W4287777399 hasOpenAccess W4287777399 @default.
- W4287777399 hasPrimaryLocation W42877773991 @default.
- W4287777399 hasRelatedWork W27483122 @default.
- W4287777399 hasRelatedWork W28987983 @default.
- W4287777399 hasRelatedWork W32827807 @default.
- W4287777399 hasRelatedWork W41478491 @default.
- W4287777399 hasRelatedWork W42446184 @default.
- W4287777399 hasRelatedWork W53881991 @default.
- W4287777399 hasRelatedWork W54441373 @default.
- W4287777399 hasRelatedWork W63987365 @default.
- W4287777399 hasRelatedWork W6502245 @default.
- W4287777399 hasRelatedWork W8866102 @default.
- W4287777399 isParatext "false" @default.
- W4287777399 isRetracted "false" @default.
- W4287777399 workType "article" @default.