A plant location guide for the unsure
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Finding Dense Subgraphs with Size Bounds
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Hardness and approximation of traffic grooming
Theoretical Computer Science
On the Maximum Quadratic Assignment Problem
Mathematics of Operations Research
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
Mathematics of Operations Research
Conditional hardness of precedence constrained scheduling on identical machines
Proceedings of the forty-second ACM symposium on Theory of computing
Algorithms and theory of computation handbook
Hardness results for approximating the bandwidth
Journal of Computer and System Sciences
A revealed preference approach to computational complexity in economics
Proceedings of the 12th ACM conference on Electronic commerce
How to cut a graph into many pieces
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
The most vital nodes with respect to independent set and vertex cover
Discrete Applied Mathematics
PTAS for densest k-subgraph in interval graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
SIAM Journal on Computing
Hardness of Precedence Constrained Scheduling on Identical Machines
SIAM Journal on Computing
Parameterized complexity of finding small degree-constrained subgraphs
Journal of Discrete Algorithms
Optimizing budget allocation among channels and influencers
Proceedings of the 21st international conference on World Wide Web
On the approximability of some degree-constrained subgraph problems
Discrete Applied Mathematics
An Improved Branch-and-Bound Method for Maximum Monomial Agreement
INFORMS Journal on Computing
On approximating string selection problems with outliers
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Dense subgraphs on dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Towards realistic team formation in social networks based on densest subgraphs
Proceedings of the 22nd international conference on World Wide Web
Truncated power method for sparse eigenvalue problems
The Journal of Machine Learning Research
On approximating string selection problems with outliers
Theoretical Computer Science
Hi-index | 0.00 |
Assuming that NP $\not\subseteq$ $\cap_{\epsilon 0}$ BPTIME($2^{n^\epsilon}$), we show that graph min-bisection, dense $k$-subgraph, and bipartite clique have no polynomial time approximation scheme (PTAS). We give a reduction from the minimum distance of code (MDC) problem. Starting with an instance of MDC, we build a quasi-random probabilistically checkable proof (PCP) that suffices to prove the desired inapproximability results. In a quasi-random PCP, the query pattern of the verifier looks random in a certain precise sense. Among the several new techniques we introduce, the most interesting one gives a way of certifying that a given polynomial belongs to a given linear subspace of polynomials. As is important for our purpose, the certificate itself happens to be another polynomial, and it can be checked probabilistically by reading a constant number of its values.