Approximation Algorithms for the Set Cover Formation by Oblivious Mobile Robots

Lecture Notes in Computer Science - Principles of Distributed Systems ◽

10.1007/978-3-319-14472-6_16 ◽

2014 ◽

pp. 233-247 ◽

Cited By ~ 1

Author(s):

Tomoko Izumi ◽

Sayaka Kamei ◽

Yukiko Yamauchi

Keyword(s):

Approximation Algorithms ◽

Mobile Robots ◽

Set Cover

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10 ◽

10.1145/1810479.1810533 ◽

2010 ◽

Cited By ~ 17

Author(s):

Matti Åstrand ◽

Jukka Suomela

Keyword(s):

Approximation Algorithms ◽

Vertex Cover ◽

Set Cover ◽

Anonymous Networks ◽

Distributed Approximation

Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems

RAIRO - Theoretical Informatics and Applications ◽

10.1051/ita/2016022 ◽

2016 ◽

Vol 50 (3) ◽

pp. 227-240 ◽

Cited By ~ 6

Author(s):

Édouard Bonnet ◽

Vangelis Th. Paschos ◽

Florian Sikora

Keyword(s):

Approximation Algorithms ◽

Set Cover ◽

Satisfiability Problems

Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

SIAM Journal on Computing ◽

10.1137/s0097539793260763 ◽

1998 ◽

Vol 28 (2) ◽

pp. 525-540 ◽

Cited By ~ 75

Author(s):

Sridhar Rajagopalan ◽

Vijay V. Vazirani

Keyword(s):

Approximation Algorithms ◽

Set Cover ◽

Integer Programs ◽

Primal Dual

Improved approximation algorithms for minimum AND-circuits problem via k-set cover

Information Processing Letters ◽

10.1016/j.ipl.2010.11.019 ◽

2011 ◽

Vol 111 (5) ◽

pp. 218-221

Author(s):

Hiroki Morizumi

Keyword(s):

Approximation Algorithms ◽

Set Cover

Improved Approximation Algorithms for Geometric Set Cover

Discrete & Computational Geometry ◽

10.1007/s00454-006-1273-8 ◽

2006 ◽

Vol 37 (1) ◽

pp. 43-58 ◽

Cited By ~ 84

Author(s):

Kenneth L. Clarkson ◽

Kasturi Varadarajan

Keyword(s):

Approximation Algorithms ◽

Set Cover ◽

Geometric Set Cover

Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties

Numerical Algebra Control & Optimization ◽

10.3934/naco.2015.5.91 ◽

2015 ◽

Vol 5 (2) ◽

pp. 91-100

Author(s):

Fengmin Wang ◽

◽

Dachuan Xu ◽

Donglei Du ◽

Chenchen Wu ◽

...

Keyword(s):

Approximation Algorithms ◽

Set Cover ◽

Primal Dual

Set-Cover Approximation Algorithms for Load-Aware Readers Placement in RFID Networks

2011 IEEE International Conference on Communications (ICC) ◽

10.1109/icc.2011.5963396 ◽

2011 ◽

Cited By ~ 9

Author(s):

Kashif Ali ◽

Waleed Alsalih ◽

Hossam Hassanein

Keyword(s):

Approximation Algorithms ◽

Set Cover ◽

Rfid Networks

Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems

Journal of Discrete Algorithms ◽

10.1016/j.jda.2006.03.008 ◽

2007 ◽

Vol 5 (1) ◽

pp. 55-64 ◽

Cited By ~ 32

Author(s):

David Peleg

Keyword(s):

Approximation Algorithms ◽

Set Cover

Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem

Information Processing Letters ◽

10.1016/j.ipl.2014.02.006 ◽

2014 ◽

Vol 114 (7) ◽

pp. 360-364

Author(s):

Cosmin Bonchiş ◽

Gabriel Istrate

Keyword(s):

Approximation Algorithms ◽

Set Cover ◽

Low Density ◽

Minimum Entropy ◽

Set Cover Problem ◽

Cover Problem

Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74240-1_6 ◽

2007 ◽

pp. 52-63 ◽

Cited By ~ 3

Author(s):

Stavros Athanassopoulos ◽

Ioannis Caragiannis ◽

Christos Kaklamanis

Keyword(s):

Approximation Algorithms ◽

Set Cover ◽

Linear Programs