High-multiplicity bin packing (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "High-multiplicity bin packing" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

7semanticscholar.org

11^th place

8^th place

3worldcat.org

5^th place

2handle.net

102^nd place

76^th place

2ieee.org

652^nd place

515^th place

2arxiv.org

69^th place

59^th place

1coursera.org

low place

1siam.org

low place

6,473^rd place

arxiv.org

Rothvoß, T. (2013-10-01). "Approximating Bin Packing within O(log OPT · Log Log OPT) Bins". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 20–29. arXiv:1301.4010. doi:10.1109/FOCS.2013.11. ISBN 978-0-7695-5135-7. S2CID 15905063.
Hoberg, Rebecca; Rothvoss, Thomas (2017-01-01), "A Logarithmic Additive Integrality Gap for Bin Packing", Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings, Society for Industrial and Applied Mathematics, pp. 2616–2625, arXiv:1503.08796, doi:10.1137/1.9781611974782.172, ISBN 978-1-61197-478-2, S2CID 1647463

coursera.org

Claire Mathieu. "Approximation Algorithms Part I, Week 3: bin packing". Coursera.

doi.org

Filippi, Carlo; Agnetis, Alessandro (2005-09-01). "An asymptotically exact algorithm for the high-multiplicity bin packing problem". Mathematical Programming. 104 (1): 21–37. doi:10.1007/s10107-004-0567-y. ISSN 1436-4646. S2CID 15140484.
Goemans, Michel X.; Rothvoß, Thomas (2013-12-18), "Polynomiality for Bin Packing with a Constant Number of Item Types", Proceedings of the 2014 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings, Society for Industrial and Applied Mathematics, pp. 830–839, doi:10.1137/1.9781611973402.61, hdl:1721.1/92865, ISBN 978-1-61197-338-9, S2CID 14006427, retrieved 2021-08-17
Goemans, Michel X.; Rothvoss, Thomas (2020-11-07). "Polynomiality for Bin Packing with a Constant Number of Item Types". Journal of the ACM. 67 (6): 38:1–38:21. doi:10.1145/3421750. hdl:1721.1/92865. ISSN 0004-5411. S2CID 14006427.
Fernandez de la Vega, W.; Lueker, G. S. (1981). "Bin packing can be solved within 1 + ε in linear time". Combinatorica. 1 (4): 349–355. doi:10.1007/BF02579456. ISSN 1439-6912. S2CID 10519631.
Karmarkar, Narendra; Karp, Richard M. (November 1982). "An efficient approximation scheme for the one-dimensional bin-packing problem". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982): 312–320. doi:10.1109/SFCS.1982.61. S2CID 18583908.
Rothvoß, T. (2013-10-01). "Approximating Bin Packing within O(log OPT · Log Log OPT) Bins". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 20–29. arXiv:1301.4010. doi:10.1109/FOCS.2013.11. ISBN 978-0-7695-5135-7. S2CID 15905063.
Hoberg, Rebecca; Rothvoss, Thomas (2017-01-01), "A Logarithmic Additive Integrality Gap for Bin Packing", Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings, Society for Industrial and Applied Mathematics, pp. 2616–2625, arXiv:1503.08796, doi:10.1137/1.9781611974782.172, ISBN 978-1-61197-478-2, S2CID 1647463

handle.net

hdl.handle.net

Goemans, Michel X.; Rothvoß, Thomas (2013-12-18), "Polynomiality for Bin Packing with a Constant Number of Item Types", Proceedings of the 2014 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings, Society for Industrial and Applied Mathematics, pp. 830–839, doi:10.1137/1.9781611973402.61, hdl:1721.1/92865, ISBN 978-1-61197-338-9, S2CID 14006427, retrieved 2021-08-17
Goemans, Michel X.; Rothvoss, Thomas (2020-11-07). "Polynomiality for Bin Packing with a Constant Number of Item Types". Journal of the ACM. 67 (6): 38:1–38:21. doi:10.1145/3421750. hdl:1721.1/92865. ISSN 0004-5411. S2CID 14006427.

ieee.org

ieeexplore.ieee.org

Karmarkar, Narendra; Karp, Richard M. (November 1982). "An efficient approximation scheme for the one-dimensional bin-packing problem". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982): 312–320. doi:10.1109/SFCS.1982.61. S2CID 18583908.
Rothvoß, T. (2013-10-01). "Approximating Bin Packing within O(log OPT · Log Log OPT) Bins". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 20–29. arXiv:1301.4010. doi:10.1109/FOCS.2013.11. ISBN 978-0-7695-5135-7. S2CID 15905063.

semanticscholar.org

api.semanticscholar.org

Filippi, Carlo; Agnetis, Alessandro (2005-09-01). "An asymptotically exact algorithm for the high-multiplicity bin packing problem". Mathematical Programming. 104 (1): 21–37. doi:10.1007/s10107-004-0567-y. ISSN 1436-4646. S2CID 15140484.
Goemans, Michel X.; Rothvoß, Thomas (2013-12-18), "Polynomiality for Bin Packing with a Constant Number of Item Types", Proceedings of the 2014 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings, Society for Industrial and Applied Mathematics, pp. 830–839, doi:10.1137/1.9781611973402.61, hdl:1721.1/92865, ISBN 978-1-61197-338-9, S2CID 14006427, retrieved 2021-08-17
Goemans, Michel X.; Rothvoss, Thomas (2020-11-07). "Polynomiality for Bin Packing with a Constant Number of Item Types". Journal of the ACM. 67 (6): 38:1–38:21. doi:10.1145/3421750. hdl:1721.1/92865. ISSN 0004-5411. S2CID 14006427.
Fernandez de la Vega, W.; Lueker, G. S. (1981). "Bin packing can be solved within 1 + ε in linear time". Combinatorica. 1 (4): 349–355. doi:10.1007/BF02579456. ISSN 1439-6912. S2CID 10519631.
Karmarkar, Narendra; Karp, Richard M. (November 1982). "An efficient approximation scheme for the one-dimensional bin-packing problem". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982): 312–320. doi:10.1109/SFCS.1982.61. S2CID 18583908.
Rothvoß, T. (2013-10-01). "Approximating Bin Packing within O(log OPT · Log Log OPT) Bins". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 20–29. arXiv:1301.4010. doi:10.1109/FOCS.2013.11. ISBN 978-0-7695-5135-7. S2CID 15905063.
Hoberg, Rebecca; Rothvoss, Thomas (2017-01-01), "A Logarithmic Additive Integrality Gap for Bin Packing", Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings, Society for Industrial and Applied Mathematics, pp. 2616–2625, arXiv:1503.08796, doi:10.1137/1.9781611974782.172, ISBN 978-1-61197-478-2, S2CID 1647463

siam.org

epubs.siam.org

Goemans, Michel X.; Rothvoß, Thomas (2013-12-18), "Polynomiality for Bin Packing with a Constant Number of Item Types", Proceedings of the 2014 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings, Society for Industrial and Applied Mathematics, pp. 830–839, doi:10.1137/1.9781611973402.61, hdl:1721.1/92865, ISBN 978-1-61197-338-9, S2CID 14006427, retrieved 2021-08-17

worldcat.org

search.worldcat.org

Filippi, Carlo; Agnetis, Alessandro (2005-09-01). "An asymptotically exact algorithm for the high-multiplicity bin packing problem". Mathematical Programming. 104 (1): 21–37. doi:10.1007/s10107-004-0567-y. ISSN 1436-4646. S2CID 15140484.
Goemans, Michel X.; Rothvoss, Thomas (2020-11-07). "Polynomiality for Bin Packing with a Constant Number of Item Types". Journal of the ACM. 67 (6): 38:1–38:21. doi:10.1145/3421750. hdl:1721.1/92865. ISSN 0004-5411. S2CID 14006427.
Fernandez de la Vega, W.; Lueker, G. S. (1981). "Bin packing can be solved within 1 + ε in linear time". Combinatorica. 1 (4): 349–355. doi:10.1007/BF02579456. ISSN 1439-6912. S2CID 10519631.