Parameterizing MAX SNP problems above guaranteed values

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

Volumn 4169 LNCS, Issue , 2006, Pages 38-49

  Mahajan, Meena ^a   Raman, Venkatesh ^a   Sikdar, Somnath ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING;

OPTIMUM SOLUTION; PARAMETERIZED VERSIONS; SOLUTION SIZE;

VALUE ENGINEERING;

EID: 33750229390     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_4     Document Type: Conference Paper

References (9)

1. L. CAI AND J. CHEN. On Fixed-Parameter Tractability and Approximability of NP Optimization Problems. Jour. Comput. Sys. Sci. 54(3): 465-474 (1997).
2. G. GUTIN, A. RAFIEY, S. SZEIDER AND A. YEO. The Linear Arrangement Problem Parameterized Above Guaranteed Value. Available at: http://arxiv.org/ abs/cs.DS/0511030
3. J. HÅSTAD AND S. VENKATESH. On the Advantage Over a Random Assignment. Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pages 43-52.
4. S. KHANNA, R. MOTWANI, M. SUDAN AND U. VAZIRANI. On Syntactic Versus Computational Views of Approximability. SIAM Jour. Computing. Vol. 28, No. 1, pp 164-191.
5. M. MAHAJAN AND V. RAMAN. Parameterizing above Guaranteed Values: MaxSat and MaxCut, Journal of Algorithms 31, 335-354 (1999).
6. R. MOTWANI AND P. RAGHAVAN. Randomized Algorithms. Cambridge University Press, 1995.
7. C. H. PAPADIMITRIOU AND M. YANNAKAKIS. Optimization, Approximation, and Complexity Classes, JCSS 43, 425-440 (1991).
8. S. POLJAK AND D. TURZÍK. A Polynomial Algorithm for Constructing a Large Bipartite Subgraph with an Application to a Satisfiability Problem. Canadian Jour. Math., Vol. 34, No. 3, 1982, pp. 519-524.
9. P. ROSSMANITH AND R. NIEDERMEIER. New Upper Bounds for Maximum Satisfiability. Journal of Algorithms, 36: 63-88, 2000.