Virginia Vassilevska, Ryan Williams, Shan Leung Maverick Woo  Home/Search
Context
Related
| cmu.edu/anon/2005/CMUCS05125.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/anon/2005/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 interesting in scenarios where the selector must decide between heuristics that are "good" with respect to di#erent complexity measures. (Update)
Active bibliography (related documents): More All
0.5: Algorithms for SAT Based on Search in Hamming Balls - Dantsin, Hirsch, Wolpert (2004) (Correct)
0.5: On The Probable Performance Of Heuristics - For Bandwidth Minimization (Correct)
0.5: A Note on Deterministic Approximate Counting for k-DNF - Trevisan (2002) (Correct)
Similar documents based on text:
5.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ vassilevska-confronting,
author = "Virginia Vassilevska and Ryan Williams and Shan Leung Maverick Woo",
title = "Confronting Hardness Using a Hybrid Approach",
url = "citeseer.ist.psu.edu/vassilevska05confronting.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
572 Computers and Intractability (context) - Garey, Johnson - 1979
403 Proof verification and the hardness of approximation problem.. - Arora, Lund et al. - 1998
226 for approximating set cover (context) - Feige, of - 1998
218 A separator theorem for planar graphs (context) - Lipton, Tarjan - 1979
189 Parameterized Complexity - Downey, Fellows - 1999
149 Approximation algorithms for NP-complete problems on planar .. (context) - Baker - 1994
120 Some optimal inapproximability results (context) - Hastad - 2001
73 and the behavior of polynomial time reducibilities on NP (context) - Selman, tally - 1979
71 Explicit constructions of linear-sized superconcentrators (context) - Gabber, Galil - 1981
44 Addressing the selective superiority problem: Automatic algo.. - Brodley - 1993
43 Beyond NP-completeness for problems of bounded width: Hardne.. - Bodlaender, Fellows et al. - 1994
35 On approximating the longest path in a graph - Karger, Motwani et al. - 1997
30 A dynamic programming approach to sequencing problems (context) - Held, Karp - 1962
25 The algorithm selection problem (context) - Rice - 1976
22 Non-approximability results for optimization problems on bou.. - Trevisan - 2001
22 A bayesian approach to tackling hard computational problems - Horvitz, Ruan et al. - 2001
21 Lower bounds on probabilistic linear decision trees (context) - Snir - 1985
20 Optimal constructions of hybrid algorithms (context) - Kao, Ma et al. - 1998
18 Color-coding - Alon, Yuster et al. - 1995
17 Shallow excluded minors and improved graph decompositions - Plotkin, Rao et al. - 1994
16 Algorithm selection using reinforcement learning - Lagoudakis, Littman - 2000
13 ciency of polynomial-time algorithms (context) - Fellows, Langston et al. - 1994
13 Sequential and parallel algorithms for embedding problems on.. (context) - Gupta, Nishimura - 1994
13 Computational tractability: The view from mars - Downey, Fellows et al. - 1999
12 Relations between average case complexity and approximation .. - Feige - 2002
12 On linear time minor tests with depth-first search (context) - Bodlaender - 1993
11 Which problems have strongly exponential complexity - Impagliazzo, Paturi et al. - 2001
10 Artificial Intelligence (context) - Gomes, Selman - 2001
9 Twelve problems in resource-bounded measure (context) - Lutz, Mayordomo - 1999
8 Max Sat approximation beyond the limits of polynomial-time a.. - Dantsin, Gavrilovich et al. - 2001
8 MaxSat is exponentially hard to approximate if NP ha positiv.. - Sat, hard et al. - 2002
8 Scientific computing and the algorithm selection problem (context) - Dyksen, Gritter - 1992
7 the existence of subexponential parameterized algorithms (context) - Cai, Juedes - 2003
7 Boosting as a metaphor for algorithm design (context) - Leyton-Brown, Nudelman et al. - 2003
6 On Euclidean embeddings and bandwidth minimization - Dunagan, Vempala - 2001
4 shorter PCPs and applications to coding (context) - Ben-Sasson, Goldreich et al. - 2004
3 It is hard to know when greedy is good for finding independe.. - Bodlaender, Thilikos et al. - 1997
3 Coping with the NP-hardness of the graph bandwidth problem (context) - Feige - 2000
3 Dynamic programming treatment of the travelling salesman pro.. (context) - Bellman - 1962
2 An algorithm for the satisfiability problem of formulas in c.. (context) - Schuler - 2003
2 Bandwidth problems in graphs (context) - Monien, Sudborough - 1980
2 A fast deterministic algorithm for formulas that have many s.. - Hirsch - 1998
1 Finding paths and cycles of superpolylogarithmic length (context) - Gabow - 2004
1 Linear FPT reductions and computational lower bounds (context) - Chen, Huang et al. - 2004
1 On approximation of the maximum clique minor containment pro.. (context) - Lingas, Wahlen - 2004
1 American Mathematical Society (context) - Bellman, dynamic et al. - 1960
1 Worst-case study of local search for Max-k-Sat - Hirsch - 2003
1 28 A Proofs Some of the proofs have been omitted from the ma.. (context) - Vazirani, Springer - 2001
Documents on the same site (http://reports-archive.adm.cs.cmu.edu/anon/2005/): More
Taxonomy and Effectiveness of Worm Defense Strategies - Brumley, Liu, Poosankam, Song (2005) (Correct)
Learning To Prevent Failure State for a Dynamically.. - Searock, Browning, Veloso (2005) (Correct)
Device-Enabled Authorization in the Grey System - Bauer, Garriss, McCune.. (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC