{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:29:13Z","timestamp":1787340553421,"version":"build-2736575974"},"reference-count":14,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,8]]},"abstract":"<jats:p>In this publication we will prove a number of negative results concerning the approximation of the NP-complete CONSECUTIVE ONES MATRIX AUGMENTATION problem. We will characterize a large class of simple algorithms that do not find a near optimum augmentation of their input matrices. We will show that there are matrices for which these algorithms find augmentations that are even far from optimal. These results are important for the analysis of a sparse matrix storage scheme.<\/jats:p>","DOI":"10.1137\/0214052","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"709-729","source":"Crossref","is-referenced-by-count":3,"title":["Approximation of the Consecutive Ones Matrix Augmentation Problem"],"prefix":"10.1137","volume":"14","author":[{"given":"Marinus","family":"Veldhorst","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,8,2]]},"reference":[{"key":"R1","unstructured":"K. S. Booth, Ph.D. Thesis,  $PQ$-tree algorithms, Univ. California, Berkeley,  1975 0367.68034"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80045-1"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0045-7825(72)90005-9"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1965.15.835"},{"key":"R5","volume-title":"Computers and intractability","author":"Garey Michael R.","year":"1979"},{"key":"R6","volume-title":"Computer solution of large sparse positive definite systems","author":"George J. A.","year":"1981"},{"key":"R7","volume-title":"Data base organization for data management","author":"Ghosh Sakti P.","year":"1977"},{"key":"R8","volume-title":"Algorithmic graph theory and perfect graphs","author":"Golumbic Martin Charles","year":"1980"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/9.3.281"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0206004"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0116616"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(72)90019-6"},{"key":"R13","volume-title":"An analysis of sparse matrix storage schemes","author":"Veldhorst M.","year":"1982"},{"key":"R14","unstructured":"M. Yannakakis, unpublished results"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214052","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:39:17Z","timestamp":1787337557000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,8]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,8]]}},"alternative-id":["10.1137\/0214052"],"URL":"https:\/\/doi.org\/10.1137\/0214052","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,8]]}}}