{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:17Z","timestamp":1725558917252},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245742"},{"type":"electronic","value":"9783540318330"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31833-0_17","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T18:11:05Z","timestamp":1278094265000},"page":"197-210","source":"Crossref","is-referenced-by-count":3,"title":["Order-Preserving Transformations and Greedy-Like Algorithms"],"prefix":"10.1007","author":[{"given":"Spyros","family":"Angelopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Angelopoulos, S.: Randomized priority algorithms. In: Proceedings of the 1st International Workshop on Approximation and Online Algorithms, pp. 27\u201340 (2003)","DOI":"10.1007\/978-3-540-24592-6_3"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/3-540-45753-4_5","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"S. Angelopoulos","year":"2002","unstructured":"Angelopoulos, S., Borodin, A.: On the power of priority algorithms for facility location and set cover. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 26\u201339. Springer, Heidelberg (2002)"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(84)90086-6","volume":"9","author":"R. Bar-Yehuda","year":"1984","unstructured":"Bar-Yehuda, R., Moran, S.: On approximation problems related to the independent set and vertex cover problems. Disc. Appl. Math.\u00a09, 1\u201310 (1984)","journal-title":"Disc. Appl. Math."},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-31833-0_12","volume-title":"Approximation and Online Algorithms","author":"A. Borodin","year":"2005","unstructured":"Borodin, A., Boyar, J., Larsen, K.S.: Priority algorithms for graph optimization problems. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol.\u00a03351, pp. 126\u2013139. Springer, Heidelberg (2005)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00453-003-1036-3","volume":"37","author":"A. Borodin","year":"2003","unstructured":"Borodin, A., Nielsen, M., Rackoff, C.: (Incremental) priority algorithms. Algorithmica\u00a037, 295\u2013326 (2003)","journal-title":"Algorithmica"},{"key":"17_CR6","unstructured":"Davis, S., Impagliazzo, R.: Models of greedy algorithms for graph problems. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (2004)"},{"issue":"4","key":"17_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\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"17_CR8","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. In: Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pp. 649\u2013657 (1998)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computation, pp. 731\u2013740 (2002)","DOI":"10.1145\/509907.510012"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of the ACM\u00a048(2), 274\u2013296 (2001)","journal-title":"Journal of the ACM"},{"issue":"3","key":"17_CR11","first-page":"256","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. JCSS\u00a09(3), 256\u2013278 (1974)","journal-title":"JCSS"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-44666-4_16","volume-title":"Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques","author":"M. Mahdian","year":"2001","unstructured":"Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: A greedy facility location algorithm analyzed using dual fitting. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol.\u00a02129, pp. 127\u2013137. Springer, Heidelberg (2001)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-45753-4_20","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M. Mahdian","year":"2002","unstructured":"Mahdian, M., Ye, J., Zhang, J.: Improved approximation algorithms for the partial vertex cover problem. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 161\u2013242. Springer, Heidelberg (2002)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Mettu, R.R., Plaxton, C.G.: The online median problem. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pp. 339\u2013348 (2000)","DOI":"10.1109\/SFCS.2000.892122"},{"issue":"3","key":"17_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0020-0190(02)00264-8","volume":"84","author":"O. Regev","year":"2002","unstructured":"Regev, O.: Priority algorithms for makespan minimization in the subset model. IPL\u00a084(3), 153\u2013157 (2002)","journal-title":"IPL"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31833-0_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:27:40Z","timestamp":1605760060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31833-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245742","9783540318330"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31833-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}