{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:39:48Z","timestamp":1725521988924},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540928614"},{"type":"electronic","value":"9783540928621"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92862-1_2","type":"book-chapter","created":{"date-parts":[[2008,12,12]],"date-time":"2008-12-12T10:14:49Z","timestamp":1229076889000},"page":"2-17","source":"Crossref","is-referenced-by-count":6,"title":["Tight Local Approximation Results for Max-Min Linear Programs"],"prefix":"10.1007","author":[{"given":"Patrik","family":"Flor\u00e9en","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marja","family":"Hassinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petteri","family":"Kaski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jukka","family":"Suomela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/S0097539793254571","volume":"24","author":"M. Naor","year":"1995","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally? SIAM Journal on Computing\u00a024(6), 1259\u20131277 (1995)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Flor\u00e9en, P., Hassinen, M., Kaski, P., Suomela, J.: Local approximation algorithms for a class of 0\/1 max-min linear programs (manuscript, 2008) arXiv:0806.0282 [cs.DC]","key":"2_CR2","DOI":"10.1145\/1583991.1584058"},{"key":"2_CR3","volume-title":"Proc. 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS)","author":"P. Flor\u00e9en","year":"2008","unstructured":"Flor\u00e9en, P., Kaski, P., Musto, T., Suomela, J.: Approximating max-min linear programs with local algorithms. In: Proc. 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), Miami, FL, USA. IEEE, Piscataway (2008)"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR5","first-page":"82","volume-title":"Proc. 12th Annual ACM Symposium on Theory of Computing (STOC)","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proc. 12th Annual ACM Symposium on Theory of Computing (STOC), Los Angeles, CA, USA, pp. 82\u201393. ACM Press, New York (1980)"},{"key":"2_CR6","first-page":"121","volume-title":"Proc. 25th Annual ACM Symposium on Theory of Computing (STOC)","author":"C.H. Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Linear programming without the matrix. In: Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), San Diego, CA, USA, pp. 121\u2013129. ACM Press, New York (1993)"},{"key":"2_CR7","first-page":"980","volume-title":"Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"F. Kuhn","year":"2006","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Miami, FL, USA, pp. 980\u2013989. ACM Press, New York (2006)"},{"key":"2_CR8","first-page":"1","volume-title":"Proc. 8th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"N.A. Lynch","year":"1989","unstructured":"Lynch, N.A.: A hundred impossibility proofs for distributed computing. In: Proc. 8th Annual ACM Symposium on Principles of Distributed Computing (PODC), Edmonton, Canada, pp. 1\u201328. ACM Press, New York (1989)"},{"key":"2_CR9","first-page":"161","volume-title":"Proc. 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)","author":"F. Kuhn","year":"2007","unstructured":"Kuhn, F., Moscibroda, T.: Distributed approximation of capacitated dominating sets. In: Proc. 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), San Diego, CA, USA, pp. 161\u2013170. ACM Press, New York (2007)"},{"key":"2_CR10","first-page":"60","volume-title":"Proc. 24th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"F. Kuhn","year":"2005","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: Proc. 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), Las Vegas, NV, USA, pp. 60\u201368. ACM Press, New York (2005)"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica\u00a08(3), 261\u2013277 (1988)","journal-title":"Combinatorica"},{"issue":"1\u20133","key":"2_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0166-218X(94)00058-L","volume":"60","author":"F. Lazebnik","year":"1995","unstructured":"Lazebnik, F., Ustimenko, V.A.: Explicit construction of graphs with an arbitrary large girth and of large size. Discrete Applied Mathematics\u00a060(1\u20133), 275\u2013284 (1995)","journal-title":"Discrete Applied Mathematics"},{"unstructured":"Hoory, S.: On Graphs of High Girth. PhD thesis, Hebrew University, Jerusalem (March 2002)","key":"2_CR13"},{"issue":"1","key":"2_CR14","doi-asserted-by":"crossref","first-page":"66","DOI":"10.37236\/1819","volume":"11","author":"B.D. McKay","year":"2004","unstructured":"McKay, B.D., Wormald, N.C., Wysocka, B.: Short cycles in random regular graphs. Electronic Journal of Combinatorics\u00a011(1), R66 (2004)","journal-title":"Electronic Journal of Combinatorics"},{"key":"2_CR15","first-page":"300","volume-title":"Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"F. Kuhn","year":"2004","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), St. John\u2019s, Newfoundland, Canada, pp. 300\u2013309. ACM Press, New York (2004)"},{"key":"2_CR16","volume-title":"Linear Programming in Infinite-Dimensional Spaces: Theory and Applications","author":"E.J. Anderson","year":"1987","unstructured":"Anderson, E.J., Nash, P.: Linear Programming in Infinite-Dimensional Spaces: Theory and Applications. John Wiley & Sons, Ltd., Chichester (1987)"},{"key":"2_CR17","series-title":"Graduate Texts in Mathematics","volume-title":"Algebraic Graph Theory","author":"C. Godsil","year":"2004","unstructured":"Godsil, C., Royle, G.: Algebraic Graph Theory. Graduate Texts in Mathematics, vol.\u00a0207. Springer, New York (2004)"},{"key":"2_CR18","volume-title":"Topology","author":"J.G. Hocking","year":"1961","unstructured":"Hocking, J.G., Young, G.S.: Topology. Addison-Wesley, Reading (1961)"},{"key":"2_CR19","volume-title":"Topology","author":"J.R. Munkres","year":"2000","unstructured":"Munkres, J.R.: Topology, 2nd edn. Prentice-Hall, Upper Saddle River (2000)","edition":"2"},{"key":"2_CR20","first-page":"883","volume-title":"Proc 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"A. Amit","year":"2001","unstructured":"Amit, A., Linial, N., Matou\u0161ek, J., Rozenman, E.: Random lifts of graphs. In: Proc 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Washington, DC, USA, pp. 883\u2013894. Society for Industrial and Applied Mathematics, Philadelphia (2001)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/3-540-45022-X_40","volume-title":"Automata, Languages and Programming","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Heljanko, K.: A new unfolding approach to LTL model checking. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 475\u2013486. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Wireless Sensor Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92862-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T18:16:42Z","timestamp":1589393802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92862-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540928614","9783540928621"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92862-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}