{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T22:22:28Z","timestamp":1649110948104},"reference-count":15,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1051\/ro:2002005","type":"journal-article","created":{"date-parts":[[2003,11,19]],"date-time":"2003-11-19T08:45:32Z","timestamp":1069231532000},"page":"53-71","source":"Crossref","is-referenced-by-count":3,"title":["Primal-dual approximation algorithms for a packing-covering pair of problems"],"prefix":"10.1051","volume":"36","author":[{"given":"Sofia","family":"Kovaleva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C.R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,7,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"J. Aerts and E.J. Marinissen, Scan chain design for test time reduction in core-based ICs, inProc. of the International Test Conference. Washington DC (1998).","DOI":"10.1109\/TEST.1998.743185"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and hardness of approximation problems, inProc. of the 33rd IEEE Symposium on the Foundations of Computer Science(1992) 14-23.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti Spaccamela and M. Protasi,Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties. Springer Verlag, Berlin (1999).","DOI":"10.1007\/978-3-642-58412-1"},{"key":"R4","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/S0097539799354138","volume":"31","author":"Bar-Noy","year":"2001","journal-title":"SIAM J. Comput."},{"key":"R5","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"Bar-Noy","year":"2001","journal-title":"J. ACM"},{"key":"R6","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1023\/A:1009822211065","volume":"4","author":"Berman","year":"2000","journal-title":"J. Combin. Optim."},{"key":"R7","unstructured":"T. Erlebach and F.C.R. Spieksma, Simple algorithms for a weighted interval selection problem, inProc. of the 11th Annual International Symposium on Algorithms and Computation (ISAAC '00). Lecture Notes in Comput. Sci.1969(2000) 228-240 (see also Report M00-01, Maastricht University)."},{"key":"R8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"Garg","year":"1997","journal-title":"Algorithmica"},{"key":"R9","unstructured":"M.X. Goemans and D.P. Williamson,The primal-dual method for approximation algorithms and its application to network design problems, Chap. 4 ofApproximation algorithms for NP-hard problems, edited by D.S. Hochbaum. PWC Publishing Company, Boston (1997)."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"M.C. Golumbic,Algorithmic Graph Theory and Perfect Graphs. Academic Press, San Diego, California (1980).","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"D.S. Hochbaum,Approximation algorithms for NP-hard problems.PWC PublishingCompany, Boston (1997).","DOI":"10.1145\/261342.571216"},{"key":"R12","unstructured":"D.S. Hochbaum,Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set and Related Problems, Chap. 3 ofApproximation algorithms for NP-hard problems, edited by D.S. Hochbaum. PWC Publishing Company, Boston (1997)."},{"key":"R13","unstructured":"C.H. Papadimitriou,Computational Complexity. Addison-Wesley, Reading, Massachussets (1994)."},{"key":"R14","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y","volume":"2","author":"Spieksma","year":"1999","journal-title":"J. Schedul."},{"key":"R15","unstructured":"D.P. Williamson, Course notesPrimal-Dual methods, available at http:\/\/www.research.ibm.com\/people\/w\/williamson\/#Notes"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2002005\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T02:49:36Z","timestamp":1585277376000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2002005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":15,"journal-issue":{"issue":"1"},"alternative-id":["ro2122"],"URL":"https:\/\/doi.org\/10.1051\/ro:2002005","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}