-
2
-
-
70449666926
-
-
M. Åstrand, P. Floréen, V. Polishchuk, J. Rybicki, J. Suomela, and J. Uitto. A local 2-approximation algorithm for the vertex cover problem, 2009. Manuscript submitted for publication.
-
M. Åstrand, P. Floréen, V. Polishchuk, J. Rybicki, J. Suomela, and J. Uitto. A local 2-approximation algorithm for the vertex cover problem, 2009. Manuscript submitted for publication.
-
-
-
-
3
-
-
0024088493
-
Computing on an anonymous ring
-
H. Attiya, M. Snir, and M. K. Warmuth. Computing on an anonymous ring. J. ACM, 35(4):845-875, 1988.
-
(1988)
J. ACM
, vol.35
, Issue.4
, pp. 845-875
-
-
Attiya, H.1
Snir, M.2
Warmuth, M.K.3
-
4
-
-
0028255806
-
Approximation algorithms for NP-complete problems on planar graphs
-
B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM, 41(1):153-180, 1994.
-
(1994)
J. ACM
, vol.41
, Issue.1
, pp. 153-180
-
-
Baker, B.S.1
-
5
-
-
56449104037
-
Fast distributed approximations in planar graphs
-
Proc. 22nd Symposium on Distributed Computing DISC 2008, of, Springer
-
A. Czygrinow, M. Hańćkowiak, and W. Wawrzyniak. Fast distributed approximations in planar graphs. In Proc. 22nd Symposium on Distributed Computing (DISC 2008), volume 5218 of LNCS, pages 78-92. Springer, 2008.
-
(2008)
LNCS
, vol.5218
, pp. 78-92
-
-
Czygrinow, A.1
Hańćkowiak, M.2
Wawrzyniak, W.3
-
6
-
-
70449656141
-
-
P. Floréen, M. Hassinen, P. Kaski, and J. Suomela. Local approximation algorithms for a class of 0/1 max-min linear programs, 2008. Manuscript, arXiv:0806.0282 [cs.DC].
-
P. Floréen, M. Hassinen, P. Kaski, and J. Suomela. Local approximation algorithms for a class of 0/1 max-min linear programs, 2008. Manuscript, arXiv:0806.0282 [cs.DC].
-
-
-
-
7
-
-
58849146608
-
Tight local approximation results for max-min linear programs
-
Proc. 4th Workshop on Algorithmic Aspects of Wireless Sensor Networks Algosensors 2008, of, Springer
-
P. Floréen, M. Hassinen, P. Kaski, and J. Suomela. Tight local approximation results for max-min linear programs. In Proc. 4th Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors 2008), volume 5389 of LNCS, pages 2-17. Springer, 2008.
-
(2008)
LNCS
, vol.5389
, pp. 2-17
-
-
Floréen, P.1
Hassinen, M.2
Kaski, P.3
Suomela, J.4
-
9
-
-
0021897852
-
Approximation schemes for covering and packing problems in image processing and VLSI
-
D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM, 32(1):130-136, 1985.
-
(1985)
J. ACM
, vol.32
, Issue.1
, pp. 130-136
-
-
Hochbaum, D.S.1
Maass, W.2
-
12
-
-
56449100279
-
Leveraging Linial's locality limit
-
Proc. 22nd Symposium on Distributed Computing DISC 2008, of, Springer
-
C. Lenzen and R. Wattenhofer. Leveraging Linial's locality limit. In Proc. 22nd Symposium on Distributed Computing (DISC 2008), volume 5218 of LNCS, pages 394-407. Springer, 2008.
-
(2008)
LNCS
, vol.5218
, pp. 394-407
-
-
Lenzen, C.1
Wattenhofer, R.2
-
13
-
-
0026821081
-
Locality in distributed graph algorithms
-
N. Linial. Locality in distributed graph algorithms. SIAM J. Comput., 21(1):193-201, 1992.
-
(1992)
SIAM J. Comput
, vol.21
, Issue.1
, pp. 193-201
-
-
Linial, N.1
-
15
-
-
0011716017
-
What can be computed locally?
-
M. Naor and L. Stockmeyer. What can be computed locally? SIAM J. Comput., 24(6):1259-1277, 1995.
-
(1995)
SIAM J. Comput
, vol.24
, Issue.6
, pp. 1259-1277
-
-
Naor, M.1
Stockmeyer, L.2
-
17
-
-
70449660973
-
-
PhD thesis, University of Helsinki, Department of Computer Science, Helsinki, Finland, May, To appear
-
J. Suomela. Optimisation Problems in Wireless Sensor Networks: Local Algorithms and Local Graphs. PhD thesis, University of Helsinki, Department of Computer Science, Helsinki, Finland, May 2009. To appear.
-
(2009)
Optimisation Problems in Wireless Sensor Networks: Local Algorithms and Local Graphs
-
-
Suomela, J.1
-
18
-
-
70449694474
-
-
J. Suomela. Survey of local algorithms. http://www.iki.fi/jukka.suomela/ local-survey, 2009. Manuscript submitted for publication.
-
J. Suomela. Survey of local algorithms. http://www.iki.fi/jukka.suomela/ local-survey, 2009. Manuscript submitted for publication.
-
-
-
-
19
-
-
0029752472
-
Computing on anonymous networks: Part I - characterizing the solvable cases
-
M. Yamashita and T. Kameda. Computing on anonymous networks: Part I - characterizing the solvable cases. IEEE Trans. Parallel Distrib. Systems, 7(1):69-89, 1996.
-
(1996)
IEEE Trans. Parallel Distrib. Systems
, vol.7
, Issue.1
, pp. 69-89
-
-
Yamashita, M.1
Kameda, T.2
-
20
-
-
0035181264
-
Sequential and parallel algorithms for mixed packing and covering
-
IEEE Computer Society Press
-
N. E. Young. Sequential and parallel algorithms for mixed packing and covering. In Proc. 42nd Symposium on Foundations of Computer Science (FOCS 2001), pages 538-546. IEEE Computer Society Press, 2001.
-
(2001)
Proc. 42nd Symposium on Foundations of Computer Science (FOCS 2001)
, pp. 538-546
-
-
Young, N.E.1
|