메뉴 건너뛰기




Volumn 49, Issue 4, 2011, Pages 672-697

Local Approximability of Max-Min and Min-Max Linear Programs

Author keywords

Approximation algorithms; Distributed algorithms; Linear programs; Local algorithms

Indexed keywords


EID: 80053443789     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-010-9303-6     Document Type: Article
Times cited : (13)

References (29)
  • 1
    • 84944076702 scopus 로고
    • Local and global properties in networks of processors
    • Los Angeles, CA, USAApril 1980, New York: ACM
    • Angluin, D.: Local and global properties in networks of processors. In: Proc. 12th Annual ACM Symposium on Theory of Computing (STOC), Los Angeles, CA, USA, April 1980, pp. 82-93. ACM, New York (1980).
    • (1980) Proc. 12th Annual ACM Symposium on Theory of Computing (STOC) , pp. 82-93
    • Angluin, D.1
  • 3
    • 77954929382 scopus 로고    scopus 로고
    • Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
    • Santorini, GreeceJune 2010, New York: ACM
    • Åstrand, M., Suomela, J.: Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. In: Proc. 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Santorini, Greece, June 2010, pp. 294-302. ACM, New York (2010).
    • (2010) Proc. 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) , pp. 294-302
    • Åstrand, M.1    Suomela, J.2
  • 5
    • 0026404904 scopus 로고
    • Distributed program checking: a paradigm for building self-stabilizing distributed protocols
    • San Juan, Puerto RicoOctober 1988, Piscataway: IEEE
    • Awerbuch, B., Varghese, G.: 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 1988, pp. 258-267. IEEE, Piscataway (1991).
    • (1991) Proc. 32nd Annual Symposium on Foundations of Computer Science (FOCS) , pp. 258-267
    • Awerbuch, B.1    Varghese, G.2
  • 6
    • 0028255806 scopus 로고
    • Approximation algorithms for NP-complete problems on planar graphs
    • Baker, B. S.: 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
  • 7
    • 56449104037 scopus 로고    scopus 로고
    • Fast distributed approximations in planar graphs
    • Arcachon, FranceSeptember 2008Lecture Notes in Computer Science, Berlin: Springer
    • Czygrinow, A., Hańćkowiak, M., Wawrzyniak, W.: Fast distributed approximations in planar graphs. In: Proc. 22nd International Symposium on Distributed Computing (DISC), Arcachon, France, September 2008. Lecture Notes in Computer Science, vol. 5218, pp. 78-92. Springer, Berlin (2008).
    • (2008) Proc. 22nd International Symposium on Distributed Computing (DISC) , vol.5218 , pp. 78-92
    • Czygrinow, A.1    Hańćkowiak, M.2    Wawrzyniak, W.3
  • 11
    • 77953609217 scopus 로고    scopus 로고
    • Almost stable matchings by truncating the Gale-Shapley algorithm
    • Floréen, P., Kaski, P., Polishchuk, V., Suomela, J.: Almost stable matchings by truncating the Gale-Shapley algorithm. Algorithmica 58(1), 102-118 (2010).
    • (2010) Algorithmica , vol.58 , Issue.1 , pp. 102-118
    • Floréen, P.1    Kaski, P.2    Polishchuk, V.3    Suomela, J.4
  • 12
    • 0032279794 scopus 로고    scopus 로고
    • On the distributed complexity of computing maximal matchings
    • San Francisco, CA, USAJanuary 1998, Philadelphia: Society for Industrial and Applied Mathematics
    • Hańćkowiak, M., Karoński, M., Panconesi, A.: On the distributed complexity of computing maximal matchings. In: Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, USA, January 1998, pp. 219-225. Society for Industrial and Applied Mathematics, Philadelphia (1998).
    • (1998) Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pp. 219-225
    • Hańćkowiak, M.1    Karoński, M.2    Panconesi, A.3
  • 13
    • 0021897852 scopus 로고
    • Approximation schemes for covering and packing problems in image processing and VLSI
    • Hochbaum, D. S., Maass, W.: 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
  • 14
    • 33748999691 scopus 로고    scopus 로고
    • PhD thesis, Hebrew University, Jerusalem (March)
    • Hoory, S.: On graphs of high girth. PhD thesis, Hebrew University, Jerusalem (March 2002).
    • (2002) On graphs of high girth
    • Hoory, S.1
  • 20
    • 56449100279 scopus 로고    scopus 로고
    • Leveraging Linial's locality limit
    • Arcachon, FranceSeptember 2008Lecture Notes in Computer Science, Berlin: Springer
    • Lenzen, C., Wattenhofer, R.: Leveraging Linial's locality limit. In: Proc. 22nd International Symposium on Distributed Computing (DISC), Arcachon, France, September 2008. Lecture Notes in Computer Science, vol. 5218, pp. 394-407. Springer, Berlin (2008).
    • (2008) Proc. 22nd International Symposium on Distributed Computing (DISC) , vol.5218 , pp. 394-407
    • Lenzen, C.1    Wattenhofer, R.2
  • 21
    • 0026821081 scopus 로고
    • Locality in distributed graph algorithms
    • Linial, N.: 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
  • 24
    • 0011716017 scopus 로고
    • What can be computed locally
    • Naor, M., Stockmeyer, L.: 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
  • 26
    • 62749093650 scopus 로고    scopus 로고
    • A simple local 3-approximation algorithm for vertex cover
    • Polishchuk, V., Suomela, J.: A simple local 3-approximation algorithm for vertex cover. Inf. Process. Lett. 109(12), 642-645 (2009).
    • (2009) Inf. Process. Lett. , vol.109 , Issue.12 , pp. 642-645
    • Polishchuk, V.1    Suomela, J.2
  • 28
    • 70350685246 scopus 로고    scopus 로고
    • Manuscript submitted for publication
    • Suomela, J.: Survey of local algorithms. http://www. iki. fi/jukka. suomela/local-survey (2009). Manuscript submitted for publication.
    • (2009) Survey of local algorithms
    • Suomela, J.1
  • 29
    • 0035181264 scopus 로고    scopus 로고
    • Sequential and parallel algorithms for mixed packing and covering
    • Las Vegas, NV, USAOctober 2001, Los Alamitos: IEEE Computer Society Press
    • Young, N. E.: Sequential and parallel algorithms for mixed packing and covering. In: Proc. 42nd Annual Symposium on Foundations of Computer Science (FOCS), Las Vegas, NV, USA, October 2001, pp. 538-546. IEEE Computer Society Press, Los Alamitos (2001).
    • (2001) Proc. 42nd Annual Symposium on Foundations of Computer Science (FOCS) , pp. 538-546
    • Young, N.E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.