Approximating max-min linear programs with local algorithms

IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM

Volumn , Issue , 2008, Pages

  Floréen, Patrik ^a   Kaski, Petteri ^a   Musto, Topi ^a   Suomela, Jukka ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS;

LOCAL ALGORITHMS; MAX-MIN; PARALLEL AND DISTRIBUTED PROCESSING;

LINEAR PROGRAMMING;

EID: 51049116218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2008.4536235     Document Type: Conference Paper

References (18)

1. B. Awerbuch and G. Varghese. Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In Proc. 32nd Annual Symposium on Foundations of Computer Science (FOCS, San Juan, Puerto Rico, October 1991), pages 258-267, Piscataway, NJ, USA, 1991. IEEE.
2. Y. Bartal, J. W. Byers, and D. Raz. Global optimization using local information with applications to flow control. In Proc. 38th Annual Symposium on Foundations of Computer Science (FOCS, Miami Beach, FL, USA, October 1997), pages 303-312, Los Alamitos, CA, USA, 1997. IEEE Computer Society Press.
3. S. Dolev. Self-Stabilization. The MIT Press, Cambridge, MA, USA, 2000.
4. P. Floréen, P. Kaski, T. Musto, and J. Suomela. Local approximation algorithms for scheduling problems in sensor networks. In Proc. 3rd International Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors, Wrocław, Poland, July 2007), volume 4837 of Lecture Notes in Computer Science, pages 99-113, Berlin, Germany, 2008. Springer-Verlag. To appear.
5. F. Kuhn and T. Moscibroda. Distributed approximation of capacitated dominating sets. In Proc. 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA, San Diego, CA, USA, June 2007), pages 161-170, New York, NY, USA, 2007. ACM Press.
6. F. Kuhn, T. Moscibroda, and R. Wattenhofer. What cannot be computed locally! In Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC, St. John's, Newfoundland, Canada, July 2004), pages 300-309, New York, NY, USA, 2004. ACM Press.
7. F. Kuhn, T. Moscibroda, and R.Wattenhofer. On the locality of bounded growth. In Proc. 24th Annual ACM Symposium on Principles of Distributed Computing (PODC, Las Vegas, NV, USA, July 2005), pages 60-68, New York, NY, USA, 2005. ACM Press.
8. F. Kuhn, T. Moscibroda, and R. Wattenhofer. Fault-tolerant clustering in ad hoc and sensor networks. In Proc. 26th IEEE International Conference on Distributed Computing Systems (ICDCS, Lisboa, Portugal, July 2006), Los Alamitos, CA, USA, 2006. IEEE Computer Society Press.
9. F. Kuhn, T. Moscibroda, and R. Wattenhofer. The price of being near-sighted. In Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA, Miami, FL, USA, January 2006), pages 980-989, New York, NY, USA, 2006. ACM Press.
10. F. Kuhn and R. Wattenhofer. Constant-time distributed dominating set approximation. Distributed Computing, 17(4):303-310, 2005.
11. N. Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1):193-201, 1992.
12. B. D. McKay, N. C. Wormald, and B. Wysocka. Short cycles in random regular graphs. Electronic Journal of Combinatorics, 11(1):#R66, 2004.
13. M. Naor and L. Stockmeyer. What can be computed locally? SIAM Journal on Computing, 24(6):1259-1277, 1995.
14. C. H. Papadimitriou and M. Yannakakis. On the value of information in distributed decision-making. In Proc. 10th Annual ACM Symposium on Principles of Distributed Computing (PODC, Montreal, Quebec, Canada, August 1991), pages 61-64, New York, NY, USA, 1991. ACM Press.
15. C. H. Papadimitriou and M. Yannakakis. Linear programming without the matrix. In Proc. 25th Annual ACM Symposium on Theory of Computing (STOC, San Diego, CA, USA, May 1993), pages 121-129, New York, NY, USA, 1993. ACM Press.
16. M. Parnas and D. Ron. Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theoretical Computer Science, 381(1-3):183-196, 2007.
17. J. Urrutia. Local solutions for global problems in wireless networks. Journal of Discrete Algorithms, 5(3):395-407, 2007.
18. J. S. Vitter. External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys, 33(2):209-271, 2001.