Approximation algorithms for combinatorial problems
Top Cited Papers
- 27 December 2007
- journal article
- Published by Elsevier
- Vol. 9 (3) , 256-278
- https://doi.org/10.1016/s0022-0000(74)80044-9
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- A technique for colouring a graph applicable to large scale timetabling problemsThe Computer Journal, 1969
- An upper bound for the chromatic number of a graph and its application to timetabling problemsThe Computer Journal, 1967