{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:45:36Z","timestamp":1743155136640,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319621265"},{"type":"electronic","value":"9783319621272"}],"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-62127-2_2","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T02:47:31Z","timestamp":1499136451000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Replica Placement on Bounded Treewidth Graphs"],"prefix":"10.1007","author":[{"given":"Anshul","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesan T.","family":"Chakaravarthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neelima","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yogish","family":"Sabharwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sachin","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sonika","family":"Thakral","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"key":"2_CR1","unstructured":"Arora, S., Chakaravarthy, V., Gupta, K., Gupta, N., Sabharwal, Y.: Replica placement on directed acyclic graphs. In: Raman, V., Suresh, S. (eds.) Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS), pp. 213\u2013225 (2014)"},{"key":"2_CR2","unstructured":"Arora, S., Chakaravarthy, V., Gupta, N., Mukherjee, K., Sabharwal, Y.: Replica placement via capacitated vertex cover. In: Seth, A., Vishnoi, N., (eds.) Proceedings of the 33rd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 263\u2013274 (2013)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Benoit, A., Larchev\u00eaque, H., Renaud-Goud, P.: Optimal algorithms and approximation algorithms for replica placement with distance constraints in tree networks. In: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1022\u20131033 (2012)","DOI":"10.1109\/IPDPS.2012.95"},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"H Bodlaender","year":"2008","unstructured":"Bodlaender, H., Koster, A.: Combinatorial optimization on graphs of bounded treewidth. Computer Journal 51(3), 255\u2013269 (2008)","journal-title":"Computer Journal"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1137\/S0097539703422479","volume":"36","author":"J Chuzhoy","year":"2006","unstructured":"Chuzhoy, J., Naor, J.: Covering problems with hard capacities. SIAM Journal of Computing 36(2), 498\u2013515 (2006)","journal-title":"SIAM Journal of Computing"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S1389-1286(02)00251-7","volume":"40","author":"Optimal allocation of electronic content","year":"2002","unstructured":"Optimal allocation of electronic content: I. Cidon, S. Kutten, and R. Soffer. Computer Networks 40, 205\u2013218 (2002)","journal-title":"Computer Networks"},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/71.932716","volume":"12","author":"K Kalpakis","year":"2001","unstructured":"Kalpakis, K., Dasgupta, K., Wolfson, O.: Optimal placement of replicas in trees with read, write, and storage costs. IEEE Transactions on Parallel and Distributed Systems 12, 628\u2013637 (2001)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-013-9844-6","volume":"72","author":"M Kao","year":"2015","unstructured":"Kao, M., Chen, H., Lee, D.: Capacitated domination: Problem complexity and approximation algorithms. Algorithmica 72(1), 1\u201343 (2015)","journal-title":"Algorithmica"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1007\/978-3-642-31594-7_64","volume-title":"Automata, Languages, and Programming","author":"B Saha","year":"2012","unstructured":"Saha, B., Khuller, S.: Set cover revisited: hypergraph cover with hard capacities. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 762\u2013773. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-31594-7_64"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62127-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:15:40Z","timestamp":1709828140000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62127-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319621265","9783319621272"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62127-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"5 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. John's","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"31 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}