On the complexity of approximating the independent set problem
Information and Computation
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the problem of sorting burnt pancakes
Discrete Applied Mathematics
Computational Complexity
Probabilistic checking of proofs and hardness of approximation problems
Probabilistic checking of proofs and hardness of approximation problems
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Sorting by reversals is difficult
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Faster and simpler algorithm for sorting signed permutations by reversals
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximating maximum independent set in bounded degree graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A 3/2-approximation algorithm for sorting by reversals
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Extremal Graph Theory
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Aligning Two Fragmented Sequences
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Approximation Hardness of TSP with Bounded Metrics
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Variable length sequencing with two lengths
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Induced Matchings in Regular Graphs and Trees
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
1.375-Approximation Algorithm for Sorting by Reversals
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Journal of Computer and System Sciences
Improved Approximation Algorithms for Relay Placement
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A fixed-parameter algorithm for string-to-string correction
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Improved approximation bounds for the minimum rainbow subgraph problem
Information Processing Letters
Inapproximability of maximal strip recovery
Theoretical Computer Science
On tree-constrained matchings and generalizations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the hardness of range assignment problems
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Finding exact and maximum occurrences of protein complexes in protein-protein interaction graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Approximating reversal distance for strings with bounded number of duplicates
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Explicit inapproximability bounds for the shortest superstring problem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Minimum common string partition problem: hardness and approximations
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Maximum likelihood of evolutionary trees is hard
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
On the approximability of Dodgson and Young elections
Artificial Intelligence
Optimal social choice functions: a utilitarian view
Proceedings of the 13th ACM Conference on Electronic Commerce
Local approximations for maximum partial subgraph problem
Operations Research Letters
Inapproximability of (1,2)-exemplar distance
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
The robust set problem: parameterized complexity and approximation
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On the complexity of the highway problem
Theoretical Computer Science
On the complexity of Newman's community finding approach for biological and social networks
Journal of Computer and System Sciences
A 6/5-approximation algorithm for the maximum 3-cover problem
Journal of Combinatorial Optimization
Optimal Auctions with Positive Network Externalities
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
Improved inapproximability results for the shortest superstring and related problems
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
Complexity results for rainbow matchings
Theoretical Computer Science
A note on anti-coordination and social interactions
Journal of Combinatorial Optimization
Inapproximability of (1,2)-Exemplar Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Guest column: the elusive inapproximability of the TSP
ACM SIGACT News
| Hi-index | 0.00 |
We give a number of improved inapproximability results, including the best up to date explicit approximation thresholds for bounded occurence satisfiability problems like MAX-2SAT and E2-LIN-2, and the bounded degree graph problems, like MIS, Node Cover, and MAX CUT. We prove also for the first time inapproximability of the problem of Sorting by Reversals and display an explicit approximation threshold.