Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5917 LNCS, Issue , 2009, Pages 222-233

  Gutin, Gregory ^a   Karapetyan, Daniel ^a   Razgon, Igor ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS OF HEURISTICS; APPROXIMATION QUALITY; BEST CHOICE; COMPUTABLE FUNCTIONS; EXACT ALGORITHMS; FIXED-PARAMETER ALGORITHMS; HEURISTIC APPROACH; LINEAR PROGRAMS; NETWORK SIZE; OPTIMAL SOLUTIONS; PARAMETERIZED PROBLEMS; PRACTICAL USE; REAL WORLD SITUATIONS; RUNNING TIME;

APPROXIMATION ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING; QUALITY CONTROL; SPACECRAFT;

HEURISTIC METHODS;

EID: 72249087390     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11269-0_18     Document Type: Conference Paper

References (27)

1. Abu-Khzam, F.N., Fellows, M.R., Langston, M., Suters, W.H.: Crown Structures for Vertex Cover Kernelization. Theory of Computing Systems 41, 411-430 (2007)
2. Abu-Khzam, F.N., Langston, M., Shanbhag, P., Symons, C.T.: Scalable Parallel Algorithms for FPT Problems. Algorithmica 45, 269-284 (2006)
3. Baker, B.M., Maye, P.J.: A Heuristic for Finding Embedded Network Structure in Mathematical Programmes. Europ. Jour. Oper. Res. 67, 52-63 (1993)
4. Bartholdi, J.J.: A Good Submatrix is Hard to Find. Oper. Res. Letters 1, 190-193 (1982)
5. Betzler, N., Hüffner, F., Niedermeier, R.: Optimal edge deletions for signed graph balancing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 297-310. Springer, Heidelberg (2007)
6. Bixby, R.E., Fourer, R.: Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics. Manag. Science 34, 342-376 (1988)
7. Bixby, R.E., Cunningham, W.H.: Converting Linear Programs to Network Problems. Math. Oper. Res. 5, 321-356 (1980)
8. Brown, G.G.,Wright,W.G.: Automatic Identification of Embedded Network Rows in Large-Scale Optimization Models. Math. Prog. 29, 41-56 (1984)
9. Chen, J., Kanj, I.A., Xia, G.: Simplicity is beauty: Improved upper bounds for vertex cover. Tech. Report TR05-008, DePaul University, Chicago IL (2005)
10. DasGupta, B., Enciso, G.A., Sontag, E.D., Zhang, Y.: Algorithmic and complexity results for decompositions of biological networks into monotone subsystems. In: Àlvarez, C., Serna,M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 253-264. Springer, Heidelberg (2006)
11. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
12. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
13. Gülpinar, N., Gutin, G., Mitra, G., Maros, I.: Detecting Embedded Pure Network Structures by Using GUB and Independent Set Algorithms. Comput. Optim. Applic. 15, 235-247 (2000)
14. Gülpinar, N., Gutin, G., Mitra, G., Zverovitch, A.: Extracting Pure Network Submatrices in Linear Programs Using Signed Graphs. Discrete Applied Mathematics 137, 359-372 (2004)
15. Gutin, G., Zverovitch, A.: Extracting pure network submatrices in linear programs using signed graphs, Part 2. Communications of DQM 6, 58-65 (2003)
16. Hansen, P.: Labelling Algorithms for Balance in Signed Graphs. In: Problémes Combinatoires et Theorie des Graphes, Colloq. Internat., Orsay, pp. 215-217 (1976);
17. Colloques Internat. du CNRS 260 Paris (1978)
18. Harary, F., Kabell, J.A.: A Simple Algorithm to Detect Balance in Signed Graphs. Math. Social Science 1, 131-136 (1980-1981)
19. Heller, I., Tompkins, C.B.: An Extension of a Theorem of Dantzig's. In: Kuhn, H.W., Tucker, A.W. (eds.) Linear Inequalities and Related Systems. Annals Math. Studies, vol. 38, pp. 247-252. Princeton Univ. Press, Princeton (1956)
20. Hsu, A.C., Fourer, R.: Identification of Embedded Network Structure in Linear Programming Models. GSIA Working Paper, 1997-58
21. Hüffner, F.: Algorithm Engineering for Optimal Graph Bipartization. Journal of Graph Algorithms and Applications 13, 77-98 (2009)
22. Kottler, S.,Kaufmann, M., Sinz, C.: Computation of Renameable Horn Backdoors. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 154-160. Springer, Heidelberg (2008)
23. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
24. Paschos, V.T.: A Δ/2-Approximation for the Maximum Independent Set Problem. Inform. Proc. Let. 44, 11-13 (1992)
25. Razgon, I., O'Sullivan, B.: Almost 2-SAT is fixed-parameter tractable. Journal of Computer and System Sciences (in press)
26. Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters 32, 299-301 (2004)
27. Zaslavsky, T.: Signed Graphs. Discete Applied Math. 4, 47-74 (1982)