{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:22:28Z","timestamp":1761488548699},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226710"},{"type":"electronic","value":"9783540277750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27775-0_27","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T20:29:36Z","timestamp":1284582576000},"page":"386-399","source":"Crossref","is-referenced-by-count":7,"title":["Rectilinear Steiner Tree Construction Using Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Esra","family":"Erdem","sequence":"first","affiliation":[]},{"given":"Martin D. F.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1137\/0114025","volume":"14","author":"M. Hanan","year":"1966","unstructured":"Hanan, M.: On Steiner\u2019s problem with rectilinear distance. SIAM Journal on Applied Mathematics\u00a014, 255\u2013265 (1966)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP complete. SIAM Journal of Applied Mathematics\u00a032, 826\u2013834 (1977)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Marek, V., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375\u2013398 (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence\u00a0138, 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(02)00186-8","volume":"138","author":"V. Lifschitz","year":"2002","unstructured":"Lifschitz, V.: Answer set programming and plan generation. Artificial Intelligence\u00a0138, 39\u201354 (2002)","journal-title":"Artificial Intelligence"},{"key":"27_CR6","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Logic Programming: Proc. of the Fifth Int\u2019l Conference and Symposium, pp. 1070\u20131080 (1988)"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"27_CR8","unstructured":"Hanan, M.: Net wiring for large scale integrated circuits. Tech. report, IBM (1965)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Design (1990)","DOI":"10.1007\/978-3-322-92106-2_3"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Nielsen, B.K., Winter, P., Zachariasen, M.: An exact algorithm for the uniformlyoriented steiner tree problem. In: Proc. of ESA, vol.\u00a010, pp. 760\u2013771 (2002)","DOI":"10.1007\/3-540-45749-6_66"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Zhou, H.: Efficient steiner tree construction based on spanning graphs. In: ACM Int\u2019l Symposium on Physical Design (2003)","DOI":"10.1145\/640000.640034"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Warme, D.M.: A new exact algorithm for rectilinear steiner trees. In: The Int\u2019l Symposium on Mathematical Programming (1997)","DOI":"10.1090\/dimacs\/040\/21"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/(SICI)1097-0037(199903)33:2<125::AID-NET4>3.0.CO;2-S","volume":"33","author":"M. Zachariasen","year":"1999","unstructured":"Zachariasen, M.: Rectilinear full steiner tree generation. Networks\u00a033, 125\u2013143 (1999)","journal-title":"Networks"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Ganley, J.L., Cohoon, J.P.: Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles. In: Proc. of the Int\u2019l Symposium on Circuits and Systems, pp. 113\u2013116 (1994)","DOI":"10.1109\/ISCAS.1994.408768"},{"key":"27_CR15","unstructured":"McCarthy, J.: Elaboration tolerance (1999) (in progress)"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1017\/S1471068403001765","volume":"3","author":"E. Erdem","year":"2003","unstructured":"Erdem, E., Lifschitz, V.: Tight logic programs. Theory and Practice of Logic Programming\u00a03, 499\u2013518 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Lloyd, J.: Foundations of Logic Programming (1984)","DOI":"10.1007\/978-3-642-96826-6"},{"key":"27_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-24609-1_32","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y. Lierler","year":"2003","unstructured":"Lierler, Y., Maratea, M.: Cmodels-2: SAT-based answer sets solver enhanced to non-tight programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 346\u2013350. Springer, Heidelberg (2003)"},{"key":"27_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/3-540-44957-4_55","volume-title":"Computational Logic - CL 2000","author":"E. Erdem","year":"2000","unstructured":"Erdem, E., Lifschitz, V., Wong, M.: Wire routing and satisfiability planning. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 822\u2013836. Springer, Heidelberg (2000)"},{"key":"27_CR20","unstructured":"Erdem, E.: Theory and Applications of Answer Set Programming. PhD thesis, University of Texas at Austin, Department of Computer Sciences (2002)"},{"key":"27_CR21","unstructured":"East, D., Truszczy\u0144ski, M.: More on wire routing with ASP. In: Working Notes of the AAAI Spring Symposium on Answer Set Programming (2001)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27775-0_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T01:17:13Z","timestamp":1636507033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27775-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226710","9783540277750"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27775-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}