3-partition problem: Difference between revisions

Content deleted Content added
DumZiBoT (talk | contribs)
DOI bot (talk | contribs)
m Citation maintenance. Initiated by Tarun2k. You can use this bot yourself! Please report any bugs.
Line 15:
* [[Michael Garey|Garey, Michael R.]] and [[David S. Johnson]] (1979), ''Computers and Intractability; A Guide to the Theory of NP-Completeness''. ISBN 0-7167-1045-5. Pages 96–105 and 224.
 
* {{cite journal | author=[[Michael Garey|Garey, Michael R.]] and [[David S. Johnson]] | title=Complexity results for multiprocessor scheduling under resource constraints | journal=SIAM Journal on Computing | volume=4 | pages=397–411 | year=1975 | doi=10.1137/0204035}}
 
[[Category:NP-complete problems]]