A simple local 3-approximation algorithm for vertex cover

Information Processing Letters

Volumn 109, Issue 12, 2009, Pages 642-645

  Polishchuk, Valentin ^a   Suomela, Jukka ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

Approximation algorithms; Distributed computing; Graph algorithms; Local algorithms

Indexed keywords

PARALLEL ALGORITHMS;

AUXILIARY INFORMATIONS; DEGREE GRAPHS; DISTRIBUTED ALGORITHMS; DISTRIBUTED COMPUTING; GRAPH ALGORITHMS; LOCAL ALGORITHMS; VERTEX COVERS;

APPROXIMATION ALGORITHMS;

EID: 62749093650     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.02.017     Document Type: Article

References (17)

1. Angluin D. Local and global properties in networks of processors. Proc. 12th Symposium on Theory of Computing (STOC 1980) (1980), ACM Press 82-93 10.1145/800141.804655
2. Czygrinow A., Hańćkowiak M., and Wawrzyniak W. Fast distributed approximations in planar graphs. Proc. 22nd Symposium on Distributed Computing (DISC 2008). LNCS vol. 5218 (2008), Springer 78-92 10.1007/978-3-540-87779-0
3. Floréen P., Hassinen M., Kaski P., and Suomela J. Tight local approximation results for max-min linear programs. Proc. 4th Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors 2008). LNCS vol. 5389 (2008), Springer 2-17 10.1007/978-3-540-92862-1
4. Floréen P., Kaski P., Musto T., and Suomela J. Approximating max-min linear programs with local algorithms. Proc. 22nd International Parallel and Distributed Processing Symposium (IPDPS 2008) (2008), IEEE 10.1109/IPDPS.2008.4536235
5. Hańćkowiak M., Karoński M., and Panconesi A. On the distributed complexity of computing maximal matchings. Proc. 9th Symposium on Discrete Algorithms (SODA 1998) (1998), SIAM 219-225
6. Hańćkowiak M., Karoński M., and Panconesi A. On the distributed complexity of computing maximal matchings. SIAM Journal on Discrete Mathematics 15 1 (2001) 41-57 10.1137/S0895480100373121
7. Hoepman J.-H., Kutten S., and Lotker Z. Efficient distributed weighted matchings on trees. Proc. 13th Colloquium on Structural Information and Communication Complexity (SIROCCO 2006). LNCS vol. 4056 (2006), Springer 115-129 10.1007/117808230
8. Kuhn F., Moscibroda T., and Wattenhofer R. What cannot be computed locally!. Proc. 23rd Symposium on Principles of Distributed Computing (PODC 2004) (2004), ACM Press 300-309 10.1145/1011767.1011811
9. Kuhn F., Moscibroda T., and Wattenhofer R. The price of being near-sighted. Proc. 17th Symposium on Discrete Algorithms (SODA 2006) (2006), ACM Press 980-989 10.1145/1109557.1109666
10. Lenzen C., Oswald Y.A., and Wattenhofer R. What can be approximated locally?. Proc. 20th Symposium on Parallel Algorithms and Architectures (SPAA 2008) (2008), ACM Press 46-54 10.1145/1378533.1378540
11. Lenzen C., and Wattenhofer R. Leveraging Linial's locality limit. Proc. 22nd Symposium on Distributed Computing (DISC 2008). LNCS vol. 5218 (2008), Springer 394-407 10.1007/978-3-540-87779-07
12. Linial N. Locality in distributed graph algorithms. SIAM Journal on Computing 21 1 (1992) 193-201 10.1137/0221015
13. T. Moscibroda, Locality, scheduling, and selfishness: Algorithmic foundations of highly decentralized networks, PhD thesis, ETH Zürich, 2006
14. Naor M., and Stockmeyer L. What can be computed locally?. SIAM Journal on Computing 24 6 (1995) 1259-1277 10.1137/S0097539793254571
15. Papadimitriou C.H., and Yannakakis M. Linear programming without the matrix. Proc. 25th Symposium on Theory of Computing (STOC 1993) (1993), ACM Press 121-129 10.1145/167088.167127
16. Wattenhofer M., and Wattenhofer R. Distributed weighted matching. Proc. 18th Symposium on Distributed Computing (DISC 2004). LNCS vol. 3274 (2004), Springer 335-348 10.1007/b101206
17. Wiese A., and Kranakis E. Local PTAS for independent set and vertex cover in location aware unit disk graphs. Proc. 4th Conference on Distributed Computing in Sensor Systems (DCOSS 2008). LNCS vol. 5067 (2008), Springer 415-431 10.1007/978-3-540-69170-98