J. Gustedt and A. Steger, "Testing Hereditary Properties Efficiently on Average," Orders, Algorithms and Applications: Proceedings of the International Workshop ORDAL'94, Springer-Verlag, Lecture Notes in Computer Science, vol. 831 (1994), 100--116.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....to prove the mathematical results that the program calls for. ffl The positive toolkit has not developed well. Few general methods are known for designing algorithms with provably good average case performance. One interesting example of a general method has been described by Gustedt and Steger [GS94]. Approximation. Most of the discussion in the chapter on coping with NP completeness in [GJ79] is devoted to explaining the basic ideas of polynomial time approximation algorithms and schemes. Early on, important polynomial time approximation schemes were found for NP complete problems such ....

....to well quasiordering methods. For width 3, there are 110 minor order obstructions. Langston et al. found that testing for just one of these gave a new heuristic algorithm superior to those then currently in use in VLSI applications [LR91] Similar ideas have been explored by Gustedt and Steger [GS94]. 4.1. A Useful Parameterized Algorithm for MAST. We next describe a useful direct FPT algorithm for the Maximum Agreement Subtree (MAST) problem defined in x1. Apart from the intrinsic interest of this result, it is a nice example of two important points concerning FPT algorithms. FPT Technique ....

J. Gustedt and A. Steger, "Testing Hereditary Properties Efficiently on Average," Orders, Algorithms and Applications: Proceedings of the International Workshop ORDAL'94, Springer-Verlag, Lecture Notes in Computer Science, vol. 831 (1994), 100--116.

....difficult to prove the mathematical results that the program calls for. ffl The positive toolkit has not developed well. Few general methods are known for designing algorithms with good average case performance. One interesting example of a general method has been described by Gustedt and Steger [GS94]. The real strength of average case analysis as a means of coping is that for most applications of computing it is the right idea for how complexity should (usually) be measured, and it is what practitioners generally continue to do about complexity measurement in practice, although informally. ....

....chosen width of the layers. This same idea can be applied to a number of other graph problems. Example 4. 2 (Testing Hereditary Properties Efficiently on Average) One of the few general techniques for devising algorithms that are efficient on average has been described by Gustedt and Steger [GS94] based on obstruction sets, one of the most powerful ideas in the FPT toolkit. The basic idea of their approach is that for some properties of combinatorial objects that are lower ideals in an appropriate partial order (which implies that the property is characterized by an obstruction set) the ....

J. Gustedt and A. Steger, "Testing Hereditary Properties Efficiently on Average," Orders, Algorithms and Applications: Proceedings of the International Workshop ORDAL'94, Springer-Verlag, Lecture Notes in Computer Science, vol. 831 (1994), 100--116.

....prove the mathematical results that the program calls for. 1 ffl The positive toolkit has not developed well. Few general methods are known for designing algorithms with provably good average case performance. One interesting example of a general method has been described by Gustedt and Steger[GS94]. Approximation. Most of the discussion in the chapter on coping with NP completeness in [GJ79] is devoted to explaining the basic ideas of polynomial time approximation algorithms and schemes. Early on, important polynomial time approximation schemes were found for NP complete problems such ....

....to well quasiordering methods. For width 3, there are 110 minor order obstructions. Langston et al. found that testing for just one of these gave a new heuristic algorithm superior to those then currently in use in VLSI applications [LR91] Similar ideas have been explored by Gustedt and Steger[GS94]. 4.1. A Useful Parameterized Algorithm for MAST. We next describe a useful direct FPT algorithm for the Maximum Agreement Subtree (MAST) problem defined in x1. Apart from the intrinsic interest of this result, it is a nice example of two important points concerning FPT algorithms. ffl Our ....

J. Gustedt and A. Steger, "Testing Hereditary Properties Efficiently on Average," Orders, Algorithms and Applications: Proceedings of the International Workshop ORDAL'94, Springer-Verlag, Lecture Notes in Computer Science, vol. 831 (1994), 100--116.

....to prove the mathematical results that the program calls for. ffl The positive toolkit has not developed well. Few general methods are known for designing algorithms with provably good average case performance. One interesting example of a general method has been described by Gustedt and Steger [GS94]. Approximation. Most of the discussion in the chapter on coping with NP completeness in [GJ79] is devoted to explaining the basic ideas of polynomial time approximation algorithms and schemes. Early on, important polynomial time approximation schemes were found for NP complete problems such ....

....to well quasiordering methods. For width 3, there are 110 minor order obstructions. Langston et al. found that testing for just one of these gave a new heuristic algorithm superior to those then currently in use in VLSI applications [LR91] Similar ideas have been explored by Gustedt and Steger [GS94]. 4.1. A Useful Parameterized Algorithm for MAST. We next describe a useful direct FPT algorithm for the Maximum Agreement Subtree (MAST) problem defined in x1. Apart from the intrinsic interest of this result, it is a nice example of two important points concerning FPT algorithms. 12 RODNEY G. ....

J. Gustedt and A. Steger, "Testing Hereditary Properties Efficiently on Average," Orders, Algorithms and Applications: Proceedings of the International Workshop ORDAL'94, Springer-Verlag, Lecture Notes in Computer Science, vol. 831 (1994), 100--116.

No context found.

J. Gustedt and A. Steger, Testing hereditary properties efficiently on average, in Proc. of Orders, Algorithms, and Applications, Lecture Notes in Computer Science, vol. 831, Springer, Berlin, 1994, pp. 100--116.

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