{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:17:55Z","timestamp":1773656275423,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,1,25]],"date-time":"2013-01-25T00:00:00Z","timestamp":1359072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00224-013-9445-4","type":"journal-article","created":{"date-parts":[[2013,1,24]],"date-time":"2013-01-24T09:12:52Z","timestamp":1359018772000},"page":"569-582","source":"Crossref","is-referenced-by-count":13,"title":["Motion Planning with Pulley, Rope, and Baskets"],"prefix":"10.1007","volume":"53","author":[{"given":"Christian E. J.","family":"Eggermont","sequence":"first","affiliation":[]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,25]]},"reference":[{"key":"9445_CR1","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/0885-064X(87)90009-4","volume":"3","author":"E.G. Coffman Jr.","year":"1987","unstructured":"Coffman, E.G. Jr., Garey, M.R., Johnson, D.S.: Bin packing with divisible item sizes. J. Complex. 3, 406\u2013428 (1987)","journal-title":"J. Complex."},{"key":"9445_CR2","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"key":"9445_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"9445_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"9445_CR5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/opre.23.2.207","volume":"23","author":"M. Magazine","year":"1975","unstructured":"Magazine, M., Nemhauser, G.L., Trotter, L.E.: When the greedy solution solves a class of knapsack problems. Oper. Res. 23, 207\u2013217 (1975)","journal-title":"Oper. Res."},{"key":"9445_CR6","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester (1990)"},{"key":"9445_CR7","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"9445_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(95)90600-K","volume":"59","author":"Y. Pochet","year":"1995","unstructured":"Pochet, Y., Wolsey, L.A.: Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separation. Discrete Appl. Math. 59, 57\u201374 (1995)","journal-title":"Discrete Appl. Math."},{"key":"9445_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L.J. Stockmeyer","year":"1977","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. Theor. Comput. Sci. 3, 1\u201322 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"9445_CR10","volume-title":"Rediscovered Lewis Carroll Puzzles","author":"E. Wakeling","year":"1995","unstructured":"Wakeling, E.: Rediscovered Lewis Carroll Puzzles. Dover, New York (1995)"},{"key":"9445_CR11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0020-0190(92)90226-L","volume":"42","author":"G.J. Woeginger","year":"1992","unstructured":"Woeginger, G.J., Yu, Z.: On the equal-subset-sum problem. Inf. Process. Lett. 42, 299\u2013302 (1992)","journal-title":"Inf. Process. Lett."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9445-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9445-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9445-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:54:24Z","timestamp":1558684464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9445-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,25]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["9445"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9445-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,25]]}}}