{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:17:11Z","timestamp":1771024631423,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,12,14]],"date-time":"2007-12-14T00:00:00Z","timestamp":1197590400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s00453-007-9142-2","type":"journal-article","created":{"date-parts":[[2007,12,13]],"date-time":"2007-12-13T17:59:11Z","timestamp":1197568751000},"page":"42-59","source":"Crossref","is-referenced-by-count":33,"title":["An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs"],"prefix":"10.1007","volume":"55","author":[{"given":"Benjamin","family":"Birnbaum","sequence":"first","affiliation":[]},{"given":"Kenneth J.","family":"Goldman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,12,14]]},"reference":[{"issue":"3","key":"9142_CR1","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s00453-001-0022-x","volume":"30","author":"C. Baur","year":"2001","unstructured":"Baur, C., Fekete, S.P.: Approximation of geometric dispersion problems. Algorithmica 30(3), 451\u2013470 (2001)","journal-title":"Algorithmica"},{"key":"9142_CR2","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: OSDI \u201999: Proceedings of the 3rd Symposium on Operating Systems Design and Implementation, Berkeley, CA, USA, pp. 173\u2013186. USENIX Association (1999)"},{"issue":"2","key":"9142_CR3","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1006\/jagm.2000.1145","volume":"38","author":"B. Chandra","year":"2001","unstructured":"Chandra, B., Halld\u00f3rsson, M.M.: Approximation algorithms for dispersion problems. J. Algorithms 38(2), 438\u2013465 (2001)","journal-title":"J. Algorithms"},{"issue":"5","key":"9142_CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0167-6377(00)00058-4","volume":"27","author":"A. Czygrinow","year":"2000","unstructured":"Czygrinow, A.: Maximum dispersion problem in dense graphs. Oper. Res. Lett. 27(5), 223\u2013227 (2000)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"9142_CR5","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U. Feige","year":"2001","unstructured":"Feige, U., Peleg, D., Kortsarz, G.: The dense k-subgraph problem. Algorithmica 29(3), 410\u2013421 (2001)","journal-title":"Algorithmica"},{"issue":"3","key":"9142_CR6","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s00453-003-1074-x","volume":"38","author":"S.P. Fekete","year":"2003","unstructured":"Fekete, S.P., Meijer, H.: Maximum dispersion and geometric maximum weight cliques. Algorithmica 38(3), 501\u2013511 (2003)","journal-title":"Algorithmica"},{"key":"9142_CR7","first-page":"111","volume":"82","author":"M. Goemans","year":"1998","unstructured":"Goemans, M., Kleinberg, J.: An improved approximation ratio for the minimum latency problem. Math. Program. 82, 111\u2013124 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"9142_CR8","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/S0895480196309791","volume":"12","author":"M.M. Halld\u00f3rsson","year":"1999","unstructured":"Halld\u00f3rsson, M.M., Iwano, K., Katoh, N., Tokuyama, T.: Finding subsets maximizing minimum structures. SIAM J. Discrete Math. 12(3), 342\u2013359 (1999)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"9142_CR9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"26","author":"R.W. Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 26(2), 147\u2013160 (1950)","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"9142_CR10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0167-6377(97)00034-5","volume":"21","author":"R. Hassin","year":"1997","unstructured":"Hassin, R., Rubinstein, S., Tamir, A.: Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21(3), 133\u2013137 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"9142_CR11","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K. Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6), 795\u2013824 (2003)","journal-title":"J. ACM"},{"key":"9142_CR12","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1145\/509907.510012","volume-title":"STOC\u00a0\u201902: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing","author":"K. Jain","year":"2002","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: STOC\u00a0\u201902: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 731\u2013740. ACM Press, New York (2002)"},{"issue":"4","key":"9142_CR13","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1111\/j.1538-4632.1987.tb00133.x","volume":"19","author":"M.J. Kuby","year":"1987","unstructured":"Kuby, M.J.: Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems. Geograph. Anal. 19(4), 315\u2013329 (1987)","journal-title":"Geograph. Anal."},{"key":"9142_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-44666-4_16","volume-title":"RANDOM-APPROX","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-APPROX, Lecture Notes in Computer Science, vol. 2129, pp. 127\u2013137. Springer, New York (2001)"},{"issue":"2","key":"9142_CR15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TIT.1977.1055688","volume":"23","author":"R.J. McEliese","year":"1977","unstructured":"McEliese, R.J., Rodemich, E.R., Rumsey, H. Jr., Welch, L.R.: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE Trans. Inf. Theory 23(2), 157\u2013166 (1977)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9142_CR16","first-page":"264","volume-title":"FOCS \u201905: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science","author":"A. Mehta","year":"2005","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized on-line matching. In: FOCS \u201905: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 264\u2013273. IEEE Computer Society, Los Alamitos (2005)"},{"issue":"2","key":"9142_CR17","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/opre.42.2.299","volume":"42","author":"S.S. Ravi","year":"1994","unstructured":"Ravi, S.S., Rosencrantz, D.J., Tayi, G.K.: Heuristic and special case algorithms for dispersion problems. Oper. Res. 42(2), 299\u2013310 (1994)","journal-title":"Oper. Res."},{"issue":"1","key":"9142_CR18","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1009802105661","volume":"4","author":"D.J. Rosenkrantz","year":"2000","unstructured":"Rosenkrantz, D.J., Tayi, G.K., Ravi, S.S.: Facility dispersion problems under capacity and cost constraints. J. Comb. Optim. 4(1), 7\u201333 (2000)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"9142_CR19","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1002\/net.20109","volume":"47","author":"D.J. Rosenkrantz","year":"2006","unstructured":"Rosenkrantz, D.J., Tayi, G.K., Ravi, S.S.: Obtaining online approximation algorithms for facility dispersion from offline algorithms. Networks 47(4), 206\u2013217 (2006)","journal-title":"Networks"},{"issue":"4","key":"9142_CR20","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0404048","volume":"4","author":"A. Tamir","year":"1991","unstructured":"Tamir, A.: Obnoxious facility location on graphs. SIAM J. Discrete Math. 4(4), 550\u2013567 (1991)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9142-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9142-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9142-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T15:16:53Z","timestamp":1630336613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9142-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,14]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["9142"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9142-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,14]]}}}