English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Coloring Problem

MPS-Authors
/persons/resource/persons44218

Canzar,  Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44374

Elbassioni,  Khaled
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45030

Mestre,  Julian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Canzar, S., Elbassioni, K., & Mestre, J. (2010). A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Coloring Problem. In Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10) (pp. 23-33). Philadelphia, PA: SIAM.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-15FF-7
Abstract
There is no abstract available