{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:35Z","timestamp":1740109295283,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2017,11,3]],"date-time":"2017-11-03T00:00:00Z","timestamp":1509667200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00453-017-0392-3","type":"journal-article","created":{"date-parts":[[2017,11,3]],"date-time":"2017-11-03T11:17:14Z","timestamp":1509707834000},"page":"3365-3396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks"],"prefix":"10.1007","volume":"80","author":[{"given":"Raphael","family":"Reitzig","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6061-9177","authenticated-orcid":false,"given":"Sebastian","family":"Wild","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,3]]},"reference":[{"key":"392_CR1","doi-asserted-by":"publisher","unstructured":"Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for any number of agents. In: Annual Symposium on Foundations of Computer Science (FOCS), pp. 416\u2013427. IEEE (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.52","DOI":"10.1109\/FOCS.2016.52"},{"issue":"4","key":"392_CR2","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448\u2013461 (1973). https:\/\/doi.org\/10.1016\/S0022-0000(73)80033-9","journal-title":"J. Comput. Syst. Sci."},{"key":"392_CR3","doi-asserted-by":"crossref","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.): Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016). ISBN: 978-1-107-06043-2","DOI":"10.1017\/CBO9781107446984"},{"key":"392_CR4","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division. Cambridge University Press, Cambridge (1996). ISBN: 978-0-521-55644-6","DOI":"10.1017\/CBO9780511598975"},{"key":"392_CR5","unstructured":"Balinski, M.L., Young, H.P.: Fair Representation: Meeting the Ideal of One Man, One Vote, 2nd edn. Brookings Institution Press, Washington (2001). ISBN: 978-0-81-570111-8"},{"key":"392_CR6","doi-asserted-by":"publisher","unstructured":"Cheng, Z., Eppstein, D.: Linear-time algorithms for proportional apportionment. In: International Symposium on Algorithms and Computation (ISAAC) 2014. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_46","DOI":"10.1007\/978-3-319-13075-0_46"},{"key":"392_CR7","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley (1994). ISBN: 978-0-20-155802-9"},{"key":"392_CR8","unstructured":"Morland, T.: Building Fences (Programming Exercise from the IDI-Open 2016 Programming Contest) (2016). https:\/\/open.kattis.com\/problems\/fence2 (visited on 02\/13\/2017)"},{"key":"392_CR9","doi-asserted-by":"publisher","unstructured":"Pukelsheim, F.: Proportional Representation. Apportionment Methods and Their Applications, 1st edn. Springer, Berlin (2014). https:\/\/doi.org\/10.1007\/978-3-319-03856-8 . ISBN: 978-3-319-03855-1","DOI":"10.1007\/978-3-319-03856-8"},{"key":"392_CR10","unstructured":"Reitzig, R., Wild S.: A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment (2015). arXiv: 1504.06475"},{"key":"392_CR11","unstructured":"Segal-Halevi, E.: Cutting equal sticks from different sticks (2014). http:\/\/cs.stackexchange.com\/q\/30073 (visited on 02\/16\/2015)"},{"key":"392_CR12","doi-asserted-by":"crossref","unstructured":"Segal-Halevi, E., Hassidim, A., Aumann, Y.: Waste makes haste: bounded time protocols for envy-free cake cutting with free disposal. In: The 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), May (2015)","DOI":"10.1145\/2988232"},{"key":"392_CR13","doi-asserted-by":"publisher","unstructured":"Segal-Halevi, E., Hassidim, A., Aumann, Y.: Waste makes haste: bounded time algorithms for envy-free cake cutting with free disposal. ACM Trans. Algorithms 13(1), 1\u201332 (2016). ISSN: 15496325. https:\/\/doi.org\/10.1145\/2988232","DOI":"10.1145\/2988232"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0392-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0392-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0392-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T11:11:42Z","timestamp":1570273902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0392-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,3]]},"references-count":13,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["392"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0392-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,11,3]]}}}