18. Bounded-size Path Packing Problems

  1. Vangelis Th. Paschos
  1. Jérǒme Monnot and
  2. Sophie Toulouse

Published Online: 3 FEB 2010

DOI: 10.1002/9780470611098.ch18

Combinatorial Optimization and Theoretical Computer Science

Combinatorial Optimization and Theoretical Computer Science

How to Cite

Monnot, J. and Toulouse, S. (2008) Bounded-size Path Packing Problems, in Combinatorial Optimization and Theoretical Computer Science (ed V. Th. Paschos), ISTE, London, UK. doi: 10.1002/9780470611098.ch18

Publication History

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

ISBN Information

Print ISBN: 9781848210219

Online ISBN: 9780470611098

SEARCH

Options for accessing this content:

  • If you are a society or association member and require assistance with obtaining online access instructions please contact our Journal Customer Services team.
    http://wiley.force.com/Interface/ContactJournalCustomerServices_V2.
  • Login via other institutional login options http://onlinelibrary.wiley.com/login-options.
  • You can purchase online access to this Chapter for a 24-hour period (price varies by title)
    • If you already have a Wiley Online Library or Wiley InterScience user account: login above and proceed to purchase the article.
    • New Users: Please register, then proceed to purchase the article.

Login via OpenAthens

or

Search for your institution's name below to login via Shibboleth.

Please register to:

  • Save publications, articles and searches
  • Get email alerts
  • Get all the benefits mentioned below!

Register now >