A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs
[chapter]

2009
*
Lecture Notes in Computer Science
*

It often happens that although a problem is FPT, the practitioners prefer to use imprecise heuristic methods to solve the problem in the real-world situation simply because of the fact that the heuristic methods are faster. In this paper we argue that in this situation an FPT algorithm for the given problem may be still of a considerable practical use. In particular, the FPT algorithm can be used to evaluate the quality of approximation of heuristic approaches. To demonstrate this way of

doi:10.1007/978-3-642-11269-0_18
fatcat:upc4576yo5a6ncpspebvjk2vu4