论文信息 - Local Approximation of Covering and Packing Problems - 字舞流文

Local Approximation of Covering and Packing Problems

Fabian Kuhn | F. Kuhn

[1] Roger Wattenhofer,et al. The price of being near-sighted , 2006, SODA '06.

[2] Roger Wattenhofer,et al. Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs , 2005, DISC.

[3] Roger Wattenhofer,et al. Local approximation schemes for ad hoc and sensor networks , 2005, DIALM-POMC '05.

[4] Roger Wattenhofer,et al. On the locality of bounded growth , 2005, PODC '05.

[5] Roger Wattenhofer,et al. What cannot be computed locally! , 2004, PODC '04.

[6] Roger Wattenhofer,et al. Constant-time distributed dominating set approximation , 2003, PODC '03.

[7] Danny Raz,et al. Global optimization using local information with applications to flow control , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[8] Moni Naor,et al. What can be computed locally? , 1993, STOC.

[9] Mihalis Yannakakis,et al. Linear programming without the matrix , 1993, STOC.

[10] Nathan Linial,et al. Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[11] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .