乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:42Z","timestamp":1725489822890},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73951-7_6","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T10:18:03Z","timestamp":1187605083000},"page":"52-63","source":"Crossref","is-referenced-by-count":0,"title":["Approximating the Maximum Sharing Problem"],"prefix":"10.1007","author":[{"given":"Amitabh","family":"Chaudhary","sequence":"first","affiliation":[]},{"given":"Danny Z.","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Rudolf","family":"Fleischer","sequence":"additional","affiliation":[]},{"given":"Xiaobo S.","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Li","sequence":"additional","affiliation":[]},{"given":"Michael T.","family":"Niemier","sequence":"additional","affiliation":[]},{"given":"Zhiyi","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1145\/996566.996671","volume-title":"DAC 2004","author":"D.A. Antonelli","year":"2004","unstructured":"Antonelli, D.A., Chen, D.Z., Dysart, T.J., Hu, X.S., Khang, A.B., Kogge, P.M., Murphy, R.C., Niemier, M.T.: Quantum-dot cellular automata (QCA) circuit partitioning: problem modeling and solutions. In: DAC 2004. Proc.\u00a041st ACM\/IEEE Design Automation Conf., pp. 363\u2013368. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1145\/1109557.1109627","volume-title":"SODA 2006","author":"P. Berman","year":"2006","unstructured":"Berman, P., Karpinski, M.: $8 \\over 7$ -approximation algorithm for (1,2)-TSP. In: SODA 2006. Proc. 17th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 641\u2013648. ACM Press, New York (2006)"},{"key":"6_CR3","unstructured":"Cao, A., Koh, C.-K.: Non-crossing ordered BDD for physical synthesis of regular circuit structure. In: Proc. International Workshop on Logic and Synthesis, pp. 200\u2013206 (2003)"},{"key":"6_CR4","first-page":"565","volume-title":"Proc.\u00a0of IEEE\/ACM International Conference on Computer-Aided Design","author":"A. Chaudhary","year":"2005","unstructured":"Chaudhary, A., Chen, D.Z., Hu, X.S., Niemier, M.T., Ravinchandran, R., Whitton, K.M.: Eliminating wire crossings for molecular quantum-dot cellular automata implementation. In: Proc.\u00a0of IEEE\/ACM International Conference on Computer-Aided Design, pp. 565\u2013571. ACM Press, New York (2005)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/11940128_55","volume-title":"Algorithms and Computation","author":"D.Z. Chen","year":"2006","unstructured":"Chen, D.Z., Fleischer, R., Li, J., Xie, Z., Zhu, H.: On approximating the maximum simple sharing problem. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 547\u2013556. Springer, Heidelberg (2006)"},{"volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","year":"1998","author":"G. Battista Di","key":"6_CR6","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1998)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(94)90179-1","volume":"131","author":"P. Eades","year":"1994","unstructured":"Eades, P., Whitesides, S.: Drawing graphs in two layers. Theor. Comput. Sci.\u00a0131, 361\u2013374 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"6_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P. Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica\u00a011(4), 379\u2013403 (1994)","journal-title":"Algorithmica"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian Journal of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.jcss.2005.12.001","volume":"72","author":"L. Engebretsen","year":"2006","unstructured":"Engebretsen, L., Karpinski, M.: TSP with bounded metrics. Journal of Computer and System Sciences\u00a072(4), 509\u2013546 (2006)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Finocchi, I.: Layered Drawings of Graphs with Crossing Constraints. In: Proc. 9th Annual International Computing and Combinatorics Conference, pp. 357\u2013367 (2001)","DOI":"10.1007\/3-540-44679-6_39"},{"key":"6_CR12","first-page":"434","volume-title":"SODA 1990","author":"H.N. Gabow","year":"1990","unstructured":"Gabow, H.N.: Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. In: SODA 1990. Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 434\u2013443. ACM Press, New York (1990)"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods\u00a04(3), 312\u2013316 (1983)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"6_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Wiley, Chichester (1990)"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"C.H. Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The traveling salesman problem with distances one and two. Mathematics of Operations Research\u00a018(1), 1\u201311 (1993)","journal-title":"Mathematics of Operations Research"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"1818","DOI":"10.1063\/1.356375","volume":"75","author":"P.D. Tougaw","year":"1994","unstructured":"Tougaw, P.D., Lent, C.S.: Logical devices implemented using quantum cellular automata. J. of App. Phys.\u00a075, 1818 (1994)","journal-title":"J. of App. Phys."},{"issue":"2","key":"6_CR17","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02460022","volume":"48","author":"M.S. Waterman","year":"1986","unstructured":"Waterman, M.S., Griggs, J.R.: Interval graphs and maps of DNA. Bull. Math. Biol.\u00a048(2), 189\u2013195 (1986)","journal-title":"Bull. Math. Biol."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:17:23Z","timestamp":1605763043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540739487","9783540739517"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}