Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem

Published 2011 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
Authors
Keywords
-
Journal
THEORETICAL COMPUTER SCIENCE
Volume 412, Issue 45, Pages 6261-6268
Publisher
Elsevier BV
Online
2011-08-02
DOI
10.1016/j.tcs.2011.07.012

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.