skip to main content
10.1145/1378533.1378541acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
research-article

Distributed packing in planar graphs

Published: 14 June 2008 Publication History

Abstract

We give an efficient distributed algorithm that finds an almost optimal packing of a graph H in a planar graph G. The algorithm is deterministic and its running time is poly-logarithmic in the order of G.

References

[1]
B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin. Network decomposition and locality in distributed computation. Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 364--369, 1989.
[2]
R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Inf. Control, 70(1):32--53, 1986.
[3]
A. Czygrinow and M. Hanckowiak. Distributed almost exact approximations for minor-closed families. In Y. Azar and T. Erlebach, editors, ESA, volume 4168 of Lecture Notes in Computer Science, pages 244--255. Springer, 2006.
[4]
A. Czygrinow and M. Hanckowiak. Distributed approximation algorithms in unit-disk graphs. In S. Dolev, editor, DISC, volume 4167 of Lecture Notes in Computer Science, pages 385--398. Springer, 2006.
[5]
A. Czygrinow and M. Hanckowiak. Distributed approximation algorithms for weighted problems in minor-closed families. In G. Lin, editor, COCOON, volume 4598 of Lecture Notes in Computer Science, pages 515--525. Springer, 2007.
[6]
A. Czygrinow and M. Hanckowiak. Distributed approximations for packing in unit-disk graphs. In A. Pelc, editor, DISC, volume 4731 of Lecture Notes in Computer Science, pages 152--164. Springer, 2007.
[7]
A. Czygrinow, M. Hanckowiak, and E. Szymanska. Distributed approximation algorithms for planar graphs. In T. Calamoneri, I. Finocchi, and G. F. Italiano, editors, CIAC, volume 3998 of Lecture Notes in Computer Science, pages 296--307. Springer, 2006.
[8]
R. Diestel. Graph Theory, third (electronic) edition, volume 173 of New York Graduate Texts in Mathematics. Springer, 2005.
[9]
M. Elkin. Distributed approximation: a survey. SIGACT News, 35(4):40--57, 2004.
[10]
@M. HaŃćkowiak, M. KaroŃski, and A. Panconesi. A faster distributed algorithm for computing maximal matchings deterministically. In PODC?99: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, pages 219--228, New York, NY, USA, 1999. ACM.
[11]
F. Kuhn, T. Moscibroda, T. Nieberg, and R. Wattenhofer. Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In P. Fraigniaud, editor, Distributed algorithms, volume 3724 of Lecture Notes In Computer Science, pages 273--287, September 2005.
[12]
. Kuhn, T. Nieberg, T. Moscibroda, and R. Wattenhofer. Local approximation schemes for ad hoc and sensor networks. In DIALM-POMC?05: Proceedings of the 2005 joint workshop on Foundations of mobile computing, pages 97--103, New York, NY, USA, 2005. ACM.
[13]
N. Linial. Locality in distributed graph algorithms. SIAM J. Comput., 21(1):193--201, 1992.
[14]
D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.

Cited By

View all
  • (2023)An Evaluation of Decentralized Group Formation Techniques for Flying Light SpecksProceedings of the 5th ACM International Conference on Multimedia in Asia10.1145/3595916.3626460(1-7)Online publication date: 6-Dec-2023
  • (2021)Compact Distributed Certification of Planar GraphsAlgorithmica10.1007/s00453-021-00823-wOnline publication date: 6-May-2021
  • (2020)Compact Distributed Certification of Planar GraphsProceedings of the 39th Symposium on Principles of Distributed Computing10.1145/3382734.3404505(319-328)Online publication date: 31-Jul-2020
  • Show More Cited By

Index Terms

  1. Distributed packing in planar graphs

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SPAA '08: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
    June 2008
    380 pages
    ISBN:9781595939739
    DOI:10.1145/1378533
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 14 June 2008

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. approximation algorithms
    2. distributed algorithms
    3. graph packing

    Qualifiers

    • Research-article

    Conference

    SPAA08

    Acceptance Rates

    Overall Acceptance Rate 447 of 1,461 submissions, 31%

    Upcoming Conference

    SPAA '25
    37th ACM Symposium on Parallelism in Algorithms and Architectures
    July 28 - August 1, 2025
    Portland , OR , USA

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 19 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)An Evaluation of Decentralized Group Formation Techniques for Flying Light SpecksProceedings of the 5th ACM International Conference on Multimedia in Asia10.1145/3595916.3626460(1-7)Online publication date: 6-Dec-2023
    • (2021)Compact Distributed Certification of Planar GraphsAlgorithmica10.1007/s00453-021-00823-wOnline publication date: 6-May-2021
    • (2020)Compact Distributed Certification of Planar GraphsProceedings of the 39th Symposium on Principles of Distributed Computing10.1145/3382734.3404505(319-328)Online publication date: 31-Jul-2020
    • (2020)Local approximation of the Maximum Cut in regular graphsTheoretical Computer Science10.1016/j.tcs.2020.03.008Online publication date: Mar-2020
    • (2015)A local approximation algorithm for minimum dominating set problem in anonymous planar networksDistributed Computing10.1007/s00446-015-0247-628:5(321-331)Online publication date: 1-Oct-2015
    • (2014)Decentralized group formationJournal of Internet Services and Applications10.1186/s13174-014-0012-25:1Online publication date: 9-Oct-2014
    • (2013)Brief announcementProceedings of the 2013 ACM symposium on Principles of distributed computing10.1145/2484239.2484281(406-408)Online publication date: 22-Jul-2013
    • (2011)Distributed algorithms for covering, packing and maximum weighted matchingDistributed Computing10.1007/s00446-011-0127-724:1(45-63)Online publication date: 1-Sep-2011
    • (2009)Distributed and parallel algorithms for weighted vertex cover and other covering problemsProceedings of the 28th ACM symposium on Principles of distributed computing10.1145/1582716.1582746(171-179)Online publication date: 10-Aug-2009
    • (2008)Leveraging Linial’s Locality LimitDistributed Computing10.1007/978-3-540-87779-0_27(394-407)Online publication date: 2008

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media