A note on graph balancing problems with restrictions. Lee, K., Leung, J. Y., & Pinedo, M. L. Information Processing Letters, 110:24--29, 2009. ![A note on graph balancing problems with restrictions [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi bibtex @article{lee_note_2009,
title = {A note on graph balancing problems with restrictions},
volume = {110},
issn = {0020-0190},
url = {http://www.sciencedirect.com/science/article/B6V0F-4XC57MY-1/2/74ca79ca0ef79b82c972714ed80258c3},
doi = {10.1016/j.ipl.2009.09.015},
urldate = {2010-11-04TZ},
journal = {Information Processing Letters},
author = {Lee, K. and Leung, J. Y.-T. and Pinedo, M. L.},
year = {2009},
keywords = {Approximation algorithm, Eligibility constraints, Fully polynomial time approximation scheme (FPTAS), Graph balancing, Parallel machines scheduling, combinatorial problems, computational complexity},
pages = {24--29}
}
Downloads: 0
{"_id":"QkpEnJRfshaDRjF8L","bibbaseid":"lee-leung-pinedo-anoteongraphbalancingproblemswithrestrictions-2009","downloads":0,"creationDate":"2016-12-19T20:50:58.729Z","title":"A note on graph balancing problems with restrictions","author_short":["Lee, K.","Leung, J. Y.","Pinedo, M. L."],"year":2009,"bibtype":"article","biburl":"http://bibbase.org/zotero/verschae","bibdata":{"bibtype":"article","type":"article","title":"A note on graph balancing problems with restrictions","volume":"110","issn":"0020-0190","url":"http://www.sciencedirect.com/science/article/B6V0F-4XC57MY-1/2/74ca79ca0ef79b82c972714ed80258c3","doi":"10.1016/j.ipl.2009.09.015","urldate":"2010-11-04TZ","journal":"Information Processing Letters","author":[{"propositions":[],"lastnames":["Lee"],"firstnames":["K."],"suffixes":[]},{"propositions":[],"lastnames":["Leung"],"firstnames":["J.","Y.-T."],"suffixes":[]},{"propositions":[],"lastnames":["Pinedo"],"firstnames":["M.","L."],"suffixes":[]}],"year":"2009","keywords":"Approximation algorithm, Eligibility constraints, Fully polynomial time approximation scheme (FPTAS), Graph balancing, Parallel machines scheduling, combinatorial problems, computational complexity","pages":"24--29","bibtex":"@article{lee_note_2009,\n\ttitle = {A note on graph balancing problems with restrictions},\n\tvolume = {110},\n\tissn = {0020-0190},\n\turl = {http://www.sciencedirect.com/science/article/B6V0F-4XC57MY-1/2/74ca79ca0ef79b82c972714ed80258c3},\n\tdoi = {10.1016/j.ipl.2009.09.015},\n\turldate = {2010-11-04TZ},\n\tjournal = {Information Processing Letters},\n\tauthor = {Lee, K. and Leung, J. Y.-T. and Pinedo, M. L.},\n\tyear = {2009},\n\tkeywords = {Approximation algorithm, Eligibility constraints, Fully polynomial time approximation scheme (FPTAS), Graph balancing, Parallel machines scheduling, combinatorial problems, computational complexity},\n\tpages = {24--29}\n}\n\n","author_short":["Lee, K.","Leung, J. Y.","Pinedo, M. L."],"key":"lee_note_2009","id":"lee_note_2009","bibbaseid":"lee-leung-pinedo-anoteongraphbalancingproblemswithrestrictions-2009","role":"author","urls":{"Paper":"http://www.sciencedirect.com/science/article/B6V0F-4XC57MY-1/2/74ca79ca0ef79b82c972714ed80258c3"},"keyword":["Approximation algorithm","Eligibility constraints","Fully polynomial time approximation scheme (FPTAS)","Graph balancing","Parallel machines scheduling","combinatorial problems","computational complexity"],"downloads":0,"html":""},"search_terms":["note","graph","balancing","problems","restrictions","lee","leung","pinedo"],"keywords":["approximation algorithm","eligibility constraints","fully polynomial time approximation scheme (fptas)","graph balancing","parallel machines scheduling","combinatorial problems","computational complexity"],"authorIDs":[],"dataSources":["TJDe75XCoX4GYYsBX"]}