Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Guest column: inapproximability results via Long Code based PCPs
ACM SIGACT News
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Graphical Models - Special issue on PG2004
Partially ordered knapsack and applications to scheduling
Discrete Applied Mathematics
Crawl ordering by search impact
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
A constant approximation algorithm for the densest k-subgraph problem on chordal graphs
Information Processing Letters
Approximating Generalized Multicut on Trees
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Solving Generalized Maximum Dispersion with Linear Programming
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Approximation and Online Algorithms
An approximation algorithm to the k-Steiner Forest problem
Theoretical Computer Science
On approximating four covering and packing problems
Journal of Computer and System Sciences
Collective annotation of Wikipedia entities in web text
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Approximating the number of frequent sets in dense data
Knowledge and Information Systems
On approximating minimum infrequent and maximum frequent sets
DS'07 Proceedings of the 10th international conference on Discovery science
Hardness and approximation of traffic grooming
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Parameterized complexity of the smallest degree-constrained subgraph problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Inapproximability of maximum weighted edge biclique and its applications
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Densest k-subgraph approximation on intersection graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Tuffy: scaling up statistical inference in Markov logic networks using an RDBMS
Proceedings of the VLDB Endowment
The hospitals/residents problem with quota lower bounds
ESA'11 Proceedings of the 19th European conference on Algorithms
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms and hardness of the k-route cut problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Overlapping clusters for distributed computation
Proceedings of the fifth ACM international conference on Web search and data mining
On the complexity of global constraint satisfaction
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Pseudorandom generators with long stretch and low locality from random local one-way functions
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems
SIAM Journal on Computing
Approximation algorithms for the sex-equal stable marriage problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A stab at approximating minimum subadditive join
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Statistical algorithms and a lower bound for detecting planted cliques
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Assuming that NP 驴 驴_驴 0 BPTIME(2^n^驴), we show that GraphMin-Bisection, Densest Subgraph and Bipartite Clique have no PTAS. We give a reduction from the Minimum Distance of Code Problem (MDC). Starting with an instance of MDC, we build a Quasi-random PCP that suffices to prove the desired inapproximability results. In a Quasi-random PCP, the query pattern of the verifier looks random in some precise sense. Among the several new techniques introduced, we give a way of certifying that a given polynomial belongs to a given subspace of polynomials. As is important for our purpose, the certificate itself happens to be another polynomial and it can be checked by reading a constant number of its values.