Chapter 16. The Complexity of the Exact Weighted Independent Set Problem
- Vangelis Th. Paschos
Published Online: 3 FEB 2010
DOI: 10.1002/9780470611098.ch16
Copyright © 2008 ISTE Ltd.
Book Title
Combinatorial Optimization and Theoretical Computer Science
Additional Information
How to Cite
Milanič, M. and Monnot, J. (2010) The Complexity of the Exact Weighted Independent Set Problem, in Combinatorial Optimization and Theoretical Computer Science (ed V. Th. Paschos), ISTE, London, UK. doi: 10.1002/9780470611098.ch16
Publication History
- Published Online: 3 FEB 2010
- Published Print: 1 JAN 2008
ISBN Information
Print ISBN: 9781848210219
Online ISBN: 9780470611098
- Summary
- Chapter
- References
Keywords:
- bipartite graph;
- optimization problems;
- pseudo-polynomial time;
- practical importance;
- polynomial results
Summary
This chapter contains sections titled:
Introduction
Preliminary observations
Hardness results
Polynomial results
Conclusion
Bibliography