Polynomiality for Bin Packing with a Constant Number of Item Types. Goemans, M. X. & Rothvoß, T. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, of SODA '14, pages 830--839, Portland, Oregon, 2014. SIAM.
Polynomiality for Bin Packing with a Constant Number of Item Types [link]Paper  bibtex   
@inproceedings{goemans_polynomiality_2014,
	address = {Portland, Oregon},
	series = {{SODA} '14},
	title = {Polynomiality for {Bin} {Packing} with a {Constant} {Number} of {Item} {Types}},
	isbn = {978-1-61197-338-9},
	url = {http://dl.acm.org/citation.cfm?id=2634074.2634135},
	urldate = {2016-02-02TZ},
	booktitle = {Proceedings of the 25th {Annual} {ACM}-{SIAM} {Symposium} on {Discrete} {Algorithms}},
	publisher = {SIAM},
	author = {Goemans, M. X. and Rothvoß, T.},
	year = {2014},
	pages = {830--839}
}

Downloads: 0