{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:58:33Z","timestamp":1725483513209},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424703"},{"type":"electronic","value":"9783540446668"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_18","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:58:07Z","timestamp":1178211487000},"page":"147-158","source":"Crossref","is-referenced-by-count":4,"title":["The Maximum Acyclic Subgraph Problem and Degree-3 Graphs"],"prefix":"10.1007","author":[{"given":"Alantha","family":"Newman","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1997.0864","volume":"25","author":"B. Berger","year":"1997","unstructured":"Bonnie Berger and Peter W. Shor. Tight Bounds on the Maximum Acyclic Subgraph Problem, Journal of Algorithms, vol. 25, pages 1\u201318, 1997.","journal-title":"Journal of Algorithms"},{"key":"18_CR2","unstructured":"Richard M Karp. Reducibility Among Combinatorial Problems, Complexity of Computer Computations, Plenum Press, 1972."},{"key":"18_CR3","unstructured":"Fang Chen and L\u00e1szl\u00f3 Lov\u00e1sz. Personal communication via Santosh Vempala."},{"key":"18_CR4","unstructured":"Alantha Newman. Approximating the Maximum Acyclic Subgraph, M.S. Thesis,MIT, June 2000."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Alantha Newman and Santosh Vempala. Fences Are Futile: On Relaxations for the Linear Ordering Problem, Proceedings of IPCO 2001, Springer-Verlag.","DOI":"10.1007\/3-540-45535-3_26"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:10:22Z","timestamp":1550319022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}