{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:55Z","timestamp":1720640875272},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s1571-0653(05)80081-2","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T19:09:41Z","timestamp":1115406581000},"page":"63-66","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract)"],"prefix":"10.1016","volume":"8","author":[{"given":"Sounaka","family":"Mishra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kripasindhu","family":"Sikdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80081-2_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895480192240226","article-title":"Performance guarantees for the approximation algorithms depending on parametrized triangle inequality","volume":"8","author":"Andreae","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S1571-0653(05)80081-2_BIB2","series-title":"\u201cProc. 4th. MPS Conference on IPCO\u201d","first-page":"14","article-title":"Approximating minimum feedback sets and multicuts in directed graphs","author":"Even","year":"1995"},{"key":"10.1016\/S1571-0653(05)80081-2_BIB3","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322077.322090","article-title":"Strong NP-completeness results: motivations, examples, and applications","volume":"25","author":"Garey","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S1571-0653(05)80081-2_BIB4","series-title":"\u201cComputers and Intractability: A Guide to the Theory of NP-Completeness\u201d","author":"Garey","year":"1979"},{"key":"10.1016\/S1571-0653(05)80081-2_BIB5","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","article-title":"A cutting plane algorithm for linear ordering problem","volume":"32","author":"Grotschel","year":"1984","journal-title":"Oper. Res."},{"key":"10.1016\/S1571-0653(05)80081-2_BIB6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF01582009","article-title":"On the acyclic subgraph polytope","volume":"33","author":"Grotschel","year":"1985","journal-title":"Math. Programming"},{"key":"10.1016\/S1571-0653(05)80081-2_BIB7","series-title":"\u201cGraph Theory\u201d","author":"Harary","year":"1969"},{"key":"10.1016\/S1571-0653(05)80081-2_BIB8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(81)90081-5","article-title":"Nondeterministic polynomial optimization problems and their applications","volume":"15","author":"Paz","year":"1981","journal-title":"Theo. Comp. Sci"},{"key":"10.1016\/S1571-0653(05)80081-2_BIB9","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, Approximation, and Complexity Classes","volume":"43","author":"Papadimitrou","year":"1991","journal-title":"J. Comput.System Sci."},{"key":"10.1016\/S1571-0653(05)80081-2_BIB10","unstructured":"S. Mishra., K. Sikdar., On Approximate Solutions of Linear Ordering Problems, Tech. Rept. No. 5\/98, Indian Statistical Institute, Calcutta."},{"key":"10.1016\/S1571-0653(05)80081-2_BIB11","series-title":"On optimizing register spills for eager functional languages, accepted in \u201cThe","author":"Mishra","year":"2001"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305800812?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305800812?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T12:24:40Z","timestamp":1548505480000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305800812"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":11,"alternative-id":["S1571065305800812"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80081-2","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}