{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:23:37Z","timestamp":1725575017379},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540663294"},{"type":"electronic","value":"9783540484134"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48413-4_7","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T07:52:41Z","timestamp":1294991561000},"page":"63-72","source":"Crossref","is-referenced-by-count":1,"title":["Set Cover with Requirements and Costs Evolving over Time"],"prefix":"10.1007","author":[{"given":"Milena","family":"Mihail","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"Handbook in Operations Research and Management Science","author":"M. Ball","year":"1992","unstructured":"Ball, M., Magnati, T., Monma, C., Hemhauser, G.: Handbook in Operations Research and Management Science, vol.\u00a08. North-Holland, Amsterdam (1992)"},{"key":"7_CR2","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S., Tardos, E., Shmoys, D.: A constant-factor Approximation Algorithm for the k-median Problem. In: STOC Proc. (1999) (to appear)","DOI":"10.1145\/301250.301257"},{"key":"7_CR4","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"D. Hochbaum","year":"1997","unstructured":"Hochbaum, D.: Approximation Algorithms for NP-Hard Problems. PSW Publishing Company, Boston (1997)"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chvatal","year":"1979","unstructured":"Chvatal, V.: A Greedy Heuristic for the Set Covering Problem. Mathematics of Operations Research\u00a04, 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1287\/inte.25.1.20","volume":"25","author":"S. Cosares","year":"1995","unstructured":"Cosares, S., Deutch, D., Saniee, I., Wasem, O.: SONET Toolkit: A Decision Sup- port System for the Design of Cost-Effective Fiber Optic Networks. Interfaces\u00a025, 20\u201340 (1995)","journal-title":"Interfaces"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Feige, U.: A Threshold of ln n for Approximating Set Cover. In: Proceedings of STOC 1996 (1996)","DOI":"10.1145\/237814.237977"},{"key":"7_CR8","unstructured":"Goemans, M., Goldberg, A., Plotkin, S., Schmoys, D., Tardos, E., Williamson, D.: Improved Approximation Algorithms for Network Design Problems. In: Proc. SODA 1994 (1994)"},{"key":"7_CR9","unstructured":"3rd INFORMS Telecommunications Conference, Special Sessions on Network De- sign Aspects about ATM and Design and Routing for Telecommunications Net- works (May 1997)"},{"key":"7_CR10","unstructured":"Jain, K.: A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem. In: FOCS Proc. 1998 (1998)"},{"key":"7_CR11","unstructured":"Jain, K., Vazirani, V.V.: Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems, submitted also in, http:\/\/www.cc.gatech.edu\/fac\/Vijay.Vazirani"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T. Magnati","year":"1984","unstructured":"Magnati, T., Wong, R.T.: Network Design and Transportation Planning: Models and Algorithms. Transportation Science\u00a018, 1\u201355 (1984)","journal-title":"Transportation Science"},{"key":"7_CR13","unstructured":"Mihail, M., Shallcross, D., Dean, N., Mostrel, M.: A Commercial Application of Survivable Network Design. In: Proc. SODA 1996 (1996)"},{"key":"7_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"7_CR15","unstructured":"Saniee, I., Bienstock, D.: ATM Network Design: Traffic Models and Optimization Based Heuristics. In: 4th INFORMS Telecommunications Conference (March 1998)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BF01299747","volume":"15","author":"D. Williamson","year":"1995","unstructured":"Williamson, D., Goemans, M., Mihail, M., Vazirani, V.: A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems. Combinatorica\u00a015, 435\u2013454 (1995)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48413-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T17:19:17Z","timestamp":1559927957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48413-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540663294","9783540484134"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48413-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}