On linear time minor tests with depth-first search
Journal of Algorithms
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Optimal constructions of hybrid algorithms
Journal of Algorithms
Shallow excluded minors and improved graph decompositions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Programming Treatment of the Travelling Salesman Problem
Journal of the ACM (JACM)
P-Complete Approximation Problems
Journal of the ACM (JACM)
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Theoretical Computer Science - Selected papers in honor of Manuel Blum
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Some optimal inapproximability results
Journal of the ACM (JACM)
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
On the existence of subexponential parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Linear FPT reductions and computational lower bounds
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Finding paths and cycles of superpolylogarithmic length
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Measured Descent: A New Embedding Method for Finite Metrics
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On the advantage over a random assignment
Random Structures & Algorithms
Approximating the bandwidth of caterpillars
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Parameterized Complexity
Efficient approximation of min set cover by moderately exponential algorithms
Theoretical Computer Science
Exponential-time approximation of weighted set cover
Information Processing Letters
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Structural properties of hard metric TSP inputs
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Improved approximations for hard optimization problems via problem instance classification
Rainbow of computer science
Discrete Applied Mathematics
Improved approximations for TSP with simple precedence constraints
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Improved parameterized algorithms for above average constraint satisfaction
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized approximation via fidelity preserving transformations
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
An exponential time 2-approximation algorithm for bandwidth
Theoretical Computer Science
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
Hi-index | 0.00 |
A hybrid algorithm is a collection of heuristics, paired with a polynomial time selector S that runs on the input to decide which heuristic should be executed to solve the problem. Hybrid algorithms are of particular interest in scenarios where the selector must decide between heuristics that are "good" with respect to different complexity measures.We focus on hybrid algorithms with a "hardness-defying" property: for a problem II, there is a set of complexity measures {mi} whereby II is known or conjectured to be unsolvable for each mi, but for each heuristic hi of the hybrid algorithm, one can give a complexity guarantee for hi on the instances of II that S selects for hi that is strictly better than mi. More concretely, we show that for several NP-hard problems, a given instance can either be solved exactly with substantially improved runtime (e.g. 2o(n)), or be approximated in polynomial time with an approximation ratio exceeding that of the known or conjectured inapproximability of the problem, assuming P ≠ NP.