16. The Complexity of the Exact Weighted Independent Set Problem

  1. Vangelis Th. Paschos
  1. Martin Milanič and
  2. Jérǒme Monnot

Published Online: 3 FEB 2010

DOI: 10.1002/9780470611098.ch16

Combinatorial Optimization and Theoretical Computer Science

Combinatorial Optimization and Theoretical Computer Science

How to Cite

Milanič, M. and Monnot, J. (2008) 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

  1. Published Online: 3 FEB 2010
  2. Published Print: 1 JAN 2008

ISBN Information

Print ISBN: 9781848210219

Online ISBN: 9780470611098

SEARCH

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