乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:58:47Z","timestamp":1725861527262},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_29","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T11:50:21Z","timestamp":1468929021000},"page":"357-369","source":"Crossref","is-referenced-by-count":1,"title":["Deterministic Algorithms for Unique Sink Orientations of Grids"],"prefix":"10.1007","author":[{"given":"Luis","family":"Barba","sequence":"first","affiliation":[]},{"given":"Malte","family":"Milatz","sequence":"additional","affiliation":[]},{"given":"Jerri","family":"Nummenpalo","sequence":"additional","affiliation":[]},{"given":"Antonis","family":"Thomas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"issue":"1\u20134","key":"29_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01840359","volume":"2","author":"A Aggarwal","year":"1987","unstructured":"Aggarwal, A., Klawe, M.M., Moran, S., Shor, P., Wilber, R.: Geometric applications of a matrix-searching algorithm. Algorithmica 2(1\u20134), 195\u2013208 (1987)","journal-title":"Algorithmica"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Chan, T.: Improved deterministic algorithms for linear programming in low dimensions. In: Proceedings of the SODA 2016 (2016, to appear)","DOI":"10.1137\/1.9781611974331.ch84"},{"issue":"1","key":"29_CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1006\/jagm.1997.0914","volume":"27","author":"TM Chan","year":"1998","unstructured":"Chan, T.M.: Deterministic algorithms for 2-d convex programming and 3-d online linear programming. J. Algorithms 27(1), 147\u2013166 (1998)","journal-title":"J. Algorithms"},{"issue":"3","key":"29_CR4","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1006\/jagm.1996.0060","volume":"21","author":"B Chazelle","year":"1996","unstructured":"Chazelle, B., Matou\u0161ek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21(3), 579\u2013597 (1996)","journal-title":"J. Algorithms"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1007\/11561071_78","volume-title":"Algorithms \u2013 ESA 2005","author":"ED Demaine","year":"2005","unstructured":"Demaine, E.D., Langerman, S.: Optimizing a 2D function satisfying unimodality properties. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 887\u2013898. Springer, Heidelberg (2005)"},{"issue":"3","key":"29_CR6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s00454-005-1187-x","volume":"34","author":"S Felsner","year":"2005","unstructured":"Felsner, S., G\u00e4rtner, B., Tschirschnitz, F.: Grid orientations, (d, d + 2)-polytopes, and arrangements of pseudolines. Discrete Comput. Geom. 34(3), 411\u2013437 (2005)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"29_CR7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(92)90135-3","volume":"92","author":"Z Galil","year":"1992","unstructured":"Galil, Z., Park, K.: Dynamic programming with convexity, concavity and sparsity. Theoret. Comput. Sci. 92(1), 49\u201376 (1992)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"29_CR8","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/rsa.10099","volume":"23","author":"B G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner, B., Tschirschnitz, F., Welzl, E., Solymosi, J., Valtr, P.: One line and n points. Random Struct. Algorithm 23(4), 453\u2013471 (2003)","journal-title":"Random Struct. Algorithm"},{"issue":"2","key":"29_CR9","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/s00453-007-9090-x","volume":"51","author":"B G\u00e4rtner","year":"2008","unstructured":"G\u00e4rtner, B., Morris Jr., W.D., R\u00fcst, L.: Unique sink orientations of grids. Algorithmica 51(2), 200\u2013235 (2008)","journal-title":"Algorithmica"},{"issue":"11","key":"29_CR10","doi-asserted-by":"crossref","first-page":"2124","DOI":"10.1016\/j.dam.2007.08.048","volume":"156","author":"B G\u00e4rtner","year":"2008","unstructured":"G\u00e4rtner, B., Matou\u0161ek, J., R\u00fcst, L., Skovron, P.: Violator spaces: structure and algorithms. Discrete Appl. Math. 156(11), 2124\u20132141 (2008)","journal-title":"Discrete Appl. Math."},{"key":"29_CR11","first-page":"201","volume":"223","author":"F Holt","year":"1999","unstructured":"Holt, F., Klee, V.: A proof of the strict monotone 4-step conjecture. Adv. Discrete Comput. Geom. Contemp. Math. 223, 201\u2013216 (1999)","journal-title":"Adv. Discrete Comput. Geom. Contemp. Math."},{"issue":"4\/5","key":"29_CR12","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16(4\/5), 498\u2013516 (1996)","journal-title":"Algorithmica"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-36494-3_19","volume-title":"STACS 2003","author":"A Mityagin","year":"2003","unstructured":"Mityagin, A.: On the complexity of finding a local maximum of functions on discrete planar subsets. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 203\u2013211. Springer, Heidelberg (2003)"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","first-page":"569","volume-title":"STACS 92","author":"M Sharir","year":"1992","unstructured":"Sharir, M., Welzl, E.: A combinatorial bound for linear programming and related problems. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 569\u2013579. Springer, Heidelberg (1992)"},{"key":"29_CR15","unstructured":"Tschirschnitz, F.: LP-related properties of polytopes with few facets. Ph.D. thesis, ETH Z\u00fcrich (2003)"},{"issue":"3","key":"29_CR16","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s004540010085","volume":"25","author":"E Welzl","year":"2001","unstructured":"Welzl, E.: Entering and leaving $$j$$ -facets. Discrete Comput. Geom. 25(3), 351\u2013364 (2001)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:44:15Z","timestamp":1498315455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}