{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:18:55Z","timestamp":1770275935179,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319519623","type":"print"},{"value":"9783319519630","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51963-0_27","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T01:17:39Z","timestamp":1484011059000},"page":"350-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Approximability of Partial Vertex Covers in Trees"],"prefix":"10.1007","author":[{"given":"Vahan","family":"Mkrtchyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ojas","family":"Parekh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Segev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"issue":"2","key":"27_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jagm.2000.1150","volume":"39","author":"R Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda, R.: Using homogeneous weights for approximating the partial cover problem. J. Algorithms 39(2), 137\u2013144 (2001)","journal-title":"J. Algorithms"},{"issue":"4","key":"27_CR2","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1137\/080728044","volume":"24","author":"R Bar-Yehuda","year":"2010","unstructured":"Bar-Yehuda, R., Flysher, G., Mestre, J., Rawitz, D.: Approximation of partial capacitated vertex cover. SIAM J. Discrete Math. 24(4), 1441\u20131469 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Bshouty, N.H., Burroughs, L.: Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem. In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, pp. 298\u2013308 (1998)","DOI":"10.1007\/BFb0028569"},{"issue":"10","key":"27_CR4","doi-asserted-by":"publisher","first-page":"2181","DOI":"10.1016\/j.comnet.2013.03.012","volume":"57","author":"B Caskurlu","year":"2013","unstructured":"Caskurlu, B., Gehani, A., Bilgin, C.\u00c7., Subramani, K.: Analytical models for risk-based intrusion response. Comput. Netw. 57(10), 2181\u20132192 (2013)","journal-title":"Comput. Netw."},{"key":"27_CR5","unstructured":"Caskurlu, B., Subramani, K.: On partial vertex cover on bipartite graphs and trees (2013). \n                      arXiv: 1304.5934"},{"issue":"1","key":"27_CR6","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 162(1), 439\u2013485 (2005)","journal-title":"Ann. Math."},{"issue":"1","key":"27_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0196-6774(83)90035-4","volume":"4","author":"GN Frederickson","year":"1983","unstructured":"Frederickson, G.N., Johnson, D.B.: Finding \n                      \n                        \n                      \n                      $$k$$\n                    -th paths and \n                      \n                        \n                      \n                      $$p$$\n                    -centers by generating and searching good data structures. J. Algorithms 4(1), 61\u201380 (1983)","journal-title":"J. Algorithms"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","volume":"53","author":"R Gandhi","year":"2004","unstructured":"Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms 53(1), 55\u201384 (2004)","journal-title":"J. Algorithms"},{"key":"27_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York (1979)"},{"key":"27_CR10","unstructured":"Gehani, A.: Performance-sensitive real-time risk management is NP-hard. In: Workshop on Foundations of Computer Security, Affiliated with the 19th IEEE Symposium on Logic in Computer Science (2004)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-45753-4_15","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"E Halperin","year":"2002","unstructured":"Halperin, E., Srinivasan, A.: Improved approximation algorithms for the partial vertex cover problem. In: Jansen, K., Leonardi, S., Vazirani, V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 161\u2013174. Springer, Heidelberg (2002). doi:\n                      10.1007\/3-540-45753-4_15"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S.: The t-vertex cover problem: extending the half integrality framework with budget constraints. In: Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization, pp. 111\u2013122 (1998)","DOI":"10.1007\/BFb0053968"},{"key":"27_CR13","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, USA (1972)"},{"issue":"3","key":"27_CR14","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within \n                      \n                        \n                      \n                      $$2-\\epsilon $$\n                    . J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"27_CR15","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00453-007-9003-z","volume":"55","author":"J Mestre","year":"2009","unstructured":"Mestre, J.: A primal-dual approximation algorithm for partial vertex cover: making educated guesses. Algorithmica 55(1), 227\u2013239 (2009)","journal-title":"Algorithmica"},{"key":"27_CR16","unstructured":"Moser, H.: Exact algorithms for generalizations of vertex cover. Master thesis, Jena University (2005)"},{"key":"27_CR17","unstructured":"N.B. of standards. In: 4th Computer Security Risk Management Model Builders Workshop, University of Maryland, College Park, Maryland, August 1991"},{"issue":"3","key":"27_CR18","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Distributions on level-sets with applications to approximation algorithms. In: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, pp. 588\u2013597 (2001)","DOI":"10.1109\/SFCS.2001.959935"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2017: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51963-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:03:05Z","timestamp":1558317785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51963-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319519623","9783319519630"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51963-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"11 January 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limerick","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 January 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}