乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:14:36Z","timestamp":1649182476342},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s00354-014-0202-2","type":"journal-article","created":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T10:49:44Z","timestamp":1399027784000},"page":"123-144","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Defining Asymptotic Parallel Time Complexity of Data-dependent Algorithms"],"prefix":"10.1007","volume":"32","author":[{"given":"Paula","family":"Fritzsche","sequence":"first","affiliation":[]},{"given":"Dolores","family":"Rexachs","sequence":"additional","affiliation":[]},{"given":"Emilio","family":"Luque","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,3]]},"reference":[{"key":"202_CR1","unstructured":"Alizadeh, F., Karp, R. M., Newberg, L. A. and Weisser, D. K., \u201cPhysical Mapping of Chromosomes: a Combinatorial Problem in Molecular Biology\u201d in SODA \u201993: Proc. of the 4th Annual ACM-SIAM Symposium on Discrete algorithms, isbn: 0-89871-313-7, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 371\u2013381, 1993."},{"key":"202_CR2","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.jcss.2008.11.001","volume":"75","author":"E. Allender","year":"2009","unstructured":"Allender E., Baul M., Immerman N., Schnoor H., Vollmer H.: \u201cThe Complexity of Satisfiability Problems: Refining Schaefer\u2019s Theorem.\u201d. J. Comput. Sys. Sci 75, 245\u2013254 (2009)","journal-title":"J. Comput. Sys. Sci"},{"key":"202_CR3","doi-asserted-by":"crossref","unstructured":"Applegate, D. L., Bixby, R. E., Chvatal, V. and Cook, W. J., The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics), Princeton University Press, 2007.","DOI":"10.1515\/9781400841103"},{"key":"202_CR4","unstructured":"Arkin, E. M., Chiang, Y., Mitchell, J. S. B., Skiena, S. S. and Yang, T., \u201cOn the Maximum Scatter TSP,\u201d in SODA \u201997: Proc. of the 8th Annual ACM-SIAM Symposium on Discrete algorithms, isbn: 0-89871-390-0, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 211\u2013220, 1997."},{"key":"202_CR5","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E. Balas","year":"1989","unstructured":"Balas E.: \u201cThe Prize Collecting Traveling Salesman Problem\u201d. Networks 19, 621\u2013636 (1989)","journal-title":"Networks"},{"key":"202_CR6","doi-asserted-by":"crossref","unstructured":"Barvinok, A., Fekete, S., Johnson, D., Tamir, A., Woeginger, G. and Woodroofe, R., \u201cThe Geometric Maximum Traveling Salesman Problem,\u201d Journal of the ACM, New York, NY, USA, 50, 5, pp. 641\u2013664, 2003.","DOI":"10.1145\/876638.876640"},{"key":"202_CR7","unstructured":"Biggs, N., Lloyd, E. K. and Wilson, R. J., Graph Theory, 1736-1936, isbn: 0-198-53916-9, Clarendon Press, New York, NY, USA, 1986."},{"key":"202_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0167-6377(89)90037-0","volume":"8","author":"R.E. Bland","year":"1989","unstructured":"Bland R.E., Shallcross D.F.: \u201cLarge Traveling Salesman Problems Arising from Experiments in X-ray Crystallography: a Preliminary Report on Computation\u201d. Operations Research Letters 8, 125\u2013128 (1989)","journal-title":"Operations Research Letters"},{"key":"202_CR9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0019-9958(58)80001-7","volume":"1","author":"W.H. Burge","year":"1958","unstructured":"Burge W.H.: \u201cSorting Trees and Measures of Order\u201d. Information and Control 1, 181\u2013197 (1958)","journal-title":"Information and Control"},{"key":"202_CR10","unstructured":"Chin, D. A., \u201cComplexity Issues in General Purpose Parallel Computing\u201d University of Oxford, 1991."},{"key":"202_CR11","unstructured":"Christofides, N., \u201cVehicle Routing,\u201d The Traveling Salesman Problem (Lawler, L., Lenstra, J. K., Kan R and Shmoys, D. B. eds.), John Wiley, pp. 431\u2013448, 1985."},{"key":"202_CR12","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/146370.146381","volume":"24","author":"V. Estivill-Castro","year":"1992","unstructured":"Estivill-Castro V., Wood D.: \u201cA Survey of Adaptive Sorting Algorithms\u201d. ACM Comput. Surv. 24, 4 (1992)","journal-title":"ACM Comput. Surv."},{"key":"202_CR13","doi-asserted-by":"crossref","unstructured":"Garey, M. R., Graham, R. L. and Johnson, D. S., \u201cSome NP-complete Geometric Problems,\u201d in STOC \u201976: Proc. of the 8th Annual ACM Symposium on Theory of computing, pp. 10\u201322, 1976.","DOI":"10.1145\/800113.803626"},{"key":"202_CR14","unstructured":"Geraerts, R. and Overmars, M. H., \u201cReachability Analysis of Sampling Based Planners,\u201d in IEEE International Conference on Robotics and Automation, John Wiley & Sons, Inc., pp. 406\u2013412, 2005."},{"key":"202_CR15","doi-asserted-by":"crossref","unstructured":"Gilmore, P. C. and Gomory, R. E., \u201cSequencing a One-State-Variable Machine: A Solvable Case of the Traveling Salesman Problem,\u201d Operations Research, 12, 5, pp. 655\u2013679, 1964.","DOI":"10.1287\/opre.12.5.655"},{"key":"202_CR16","unstructured":"Fritzsche, P., \u201c\u00bf\u2018Podemos Predecir en Algoritmos Paralelos No Deterministas?\u201d Computer Architecture and Operating Systems Department, University Autonoma of Barcelona, Spain, http:\/\/caos.uab.es\/ , 2007."},{"key":"202_CR17","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"B.L. Golden","year":"1987","unstructured":"Golden B.L., Levy L., Vohra R.: \u201cThe Orienteering Problem\u201d. Naval Research Logistics 34, 307\u2013318 (1987)","journal-title":"Naval Research Logistics"},{"key":"202_CR18","unstructured":"Groth, R., Data Mining: a Hands-on Approach for Business Professionals, Prentice Hall PTR, 1998."},{"key":"202_CR19","doi-asserted-by":"crossref","unstructured":"Huttenlocher, D., Klanderman, G. and Rucklidge, W., \u201cComparing Images Using the Hausdorff Distance,\u201d IEEE Transactions on Pattern Analysis and Machine Intelligence, 15, 9, pp. 850\u2013863, 1993.","DOI":"10.1109\/34.232073"},{"key":"202_CR20","unstructured":"Jarrard, R. D., Scientific Methods, an online book, Dept. of Geology and Geophysics, University of Utah, 2001."},{"key":"202_CR21","doi-asserted-by":"crossref","unstructured":"Johnson, D. S. and McGeoch, L. A., \u201cThe Traveling Salesman Problem: A Case Study in Local Optimization,\u201d in Local Search in Combinatorial Optimization, pp. 215\u2013310, 1997.","DOI":"10.2307\/j.ctv346t9c.13"},{"key":"202_CR22","doi-asserted-by":"crossref","unstructured":"Johnson, D. S. and McGeoch, L. A., \u201cExperimental Analysis of Heuristics for the STSP,\u201d isbn: 978-1-4020-0664-7, in The Traveling Salesman Problem and Its Variations, 12, pp. 369\u2013443, 2004.","DOI":"10.1007\/0-306-48213-4_9"},{"issue":"8","key":"202_CR23","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/j.dam.2006.08.006","volume":"155","author":"S.G. Kolliopoulos","year":"2007","unstructured":"Kolliopoulos S.G., Steiner G.: \u201cPartially Ordered Knapsack and Applications to Scheduling\u201d. Discrete Applied Mathematics 155 (8), 889\u2013897 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"202_CR24","doi-asserted-by":"crossref","unstructured":"Korostensky, C. and Gonnet, G. H., \u201cUsing Traveling Salesman Problem Algorithms for Evolutionary Tree Construction,\u201d BIOINF: Bioinformatics, 16, 7, pp. 619\u2013627, 2000.","DOI":"10.1093\/bioinformatics\/16.7.619"},{"issue":"4","key":"202_CR25","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1057\/jors.1975.151","volume":"26","author":"J.K. Lenstra","year":"1975","unstructured":"Lenstra J.K., Kan A.R.: \u201cSome Simple Applications of the Travelling Salesman Problem\u201d. Operations Research Quarterly 26 (4), 717\u2013732 (1975)","journal-title":"Operations Research Quarterly"},{"key":"202_CR26","unstructured":"MacQueen, J. B., \u201cSome Methods for Classification and Analysis of MultiVariate Observations,\u201d in Proc. of the fifth Berkeley Symposium on Mathematical Statistics and Probability (Le Cam L. M. and Neyman J. eds.), University of California Press, 1, pp. 281\u2013297, 1967."},{"key":"202_CR27","unstructured":"Martello, S. and Toth, P., Knapsack Problems: Algorithms and Computer Implementations, isbn: 0-471-92420-2, John Wiley & Sons, Inc., New York, NY, USA, 1990."},{"key":"202_CR28","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1126\/science.251.4995.754","volume":"251","author":"D. Miller","year":"1991","unstructured":"Miller D., Pekny J.: \u201cExact Solution of Large Asymmetric Traveling Salesman Problems\u201d. Science 251, 754\u2013761 (1991)","journal-title":"Science"},{"key":"202_CR29","unstructured":"Miller, R. and Boxer, L., Algorithms Sequential and Parallel: A Unified Approach, isbn: 1-58450-412-9, Charles River Media, Computer Engineering Series, 2005."},{"key":"202_CR30","doi-asserted-by":"crossref","unstructured":"Ratliff, H. D. and Rosenthal, A. S., \u201cOrder-Picking in a RectangularWarehouse: A Solvable Case for the Traveling Salesman Problem,\u201d Operations Research, 31, 3, pp. 507\u2013521, 1983.","DOI":"10.1287\/opre.31.3.507"},{"key":"202_CR31","unstructured":"Sankoff, D. and Blanchette, M., \u201cThe Median Problem for Breakpoints in Comparative Genomics,\u201d in COCOON \u201997: Proc. of the 3rd Annual International Conference on Computing and Combinatorics, isbn: 3-540-63357-X, Springer-Verlag, London, UK, pp. 251\u2013264, 1997."},{"key":"202_CR32","doi-asserted-by":"crossref","unstructured":"Schaefer, T. J., \u201cThe Complexity of Satisfiability Problems,\u201d STOC, pp. 216\u2013226, 1978.","DOI":"10.1145\/800133.804350"},{"key":"202_CR33","unstructured":"Schrijver, A., \u201cOn the History of Combinatorial Optimization (till 1960),\u201d CWI (Centre for Mathematics and Computer Science), Amsterdam, The Netherlands, 1990."},{"key":"202_CR34","unstructured":"Skiena, S. S., The Algorithm Design Manual, isbn: 0-387-94860-0, Springer-Verlag New York, Inc., New York, NY, USA, 1998."},{"key":"202_CR35","unstructured":"Takaoka, T., \u201cA New Measure of Disorder in Sorting \u2013 Entropy,\u201d CATS, pp. 441\u2013476, 1998."},{"key":"202_CR36","unstructured":"TSP Page, http:\/\/www.tsp.gatech.edu\/history\/ , 2008."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-014-0202-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00354-014-0202-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-014-0202-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:57:32Z","timestamp":1648922252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00354-014-0202-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["202"],"URL":"https:\/\/doi.org\/10.1007\/s00354-014-0202-2","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4]]}}}