BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
result (8)
problem (4)
hypergraph (3)
optim (3)
cover (3)

Stem inapproxim$ (all stems)

22 papers:

STOCSTOC-2015-BraunPZ #combinator #problem
Inapproximability of Combinatorial Problems via Small LPs and SDPs (GB, SP, DZ), pp. 107–116.
Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension (AD, MS, GS), pp. 401–408.
STOCSTOC-2015-Rubinstein #equilibrium #nash
Inapproximability of Nash Equilibrium (AR), pp. 409–418.
Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region (AG, DS, EV), pp. 823–831.
STOCSTOC-2011-Yoshida #algorithm #approximate #bound #csp
Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP (YY), pp. 665–674.
ICALPICALP-v1-2010-BansalK #problem #scheduling
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems (NB, SK), pp. 250–261.
ICALPICALP-v1-2010-GuruswamiS #on the
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs (VG, RS), pp. 360–371.
STOCSTOC-2008-Raghavendra #algorithm #csp #question
Optimal algorithms and inapproximability results for every CSP? (PR), pp. 245–254.
STOCSTOC-2008-SkopalikV #nash
Inapproximability of pure nash equilibria (AS, BV), pp. 355–364.
STOCSTOC-2007-GoldbergJ #polynomial
Inapproximability of the Tutte polynomial (LAG, MJ), pp. 459–468.
DLTDLT-2007-GruberH #complexity #exclamation #nondeterminism
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP (HG, MH), pp. 205–216.
STOCSTOC-2006-Zuckerman #clique #linear
Linear degree extractors and the inapproximability of max clique and chromatic number (DZ), pp. 681–690.
ICALPICALP-v1-2006-KhotP #clique
Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion (SK, AKP), pp. 226–237.
ICALPICALP-2005-LinRTW #exponential #fibonacci
Braess’s Paradox, Fibonacci Numbers, and Exponential Inapproximability (HCL, TR, ÉT, AW), pp. 497–512.
Polylogarithmic inapproximability (EH, RK), pp. 585–594.
ICALPICALP-2002-EngebretsenHR #equation #finite
Inapproximability Results for Equations over Finite Groups (LE, JH, AR), pp. 73–84.
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs (JH), pp. 1005–1016.
STOCSTOC-2000-Srinivasan #clique
The value of strong inapproximability results for clique (AS), pp. 144–152.
ICALPICALP-2000-ElkinP #problem
Strong Inapproximability of the Basic k-Spanner Problem (ME, DP), pp. 636–647.
ICALPICALP-1999-BermanK #on the
On Some Tighter Inapproximability Results (Extended Abstract) (PB, MK), pp. 200–209.
ICALPICALP-1999-Umans #complexity #on the #problem
On the Complexity and Inapproximability of Shortest Implicant Problems (CU), pp. 687–696.
Some Optimal Inapproximability Results (JH), pp. 1–10.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.