Skip to main content
Springer Nature Link
Log in

Computing and Combinatorics

30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I

  • Conference proceedings
  • © 2025

Overview

Editors:
  1. Yong Chen

    1. Hangzhou Dianzi University, Hangzhou, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Xiaofeng Gao

    1. Shanghai Jiao Tong University, Shanghai, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Xiaoming Sun

    1. Chinese Academy of Sciences, Beijing, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. An Zhang

    1. Hangzhou Dianzi University, Hangzhou, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 15161)

Included in the following conference series:

Conference proceedings info: COCOON 2024.

  • 8331 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This three-volume set LNCS 15161, 15162 and 15163 constitutes the refereed proceedings of the 30th International Conference, COCOON 2024, held in Shanghai, China, during August 23–25, 2024.
The 90 full papers and 6 short papers were carefully reviewed and selected from 277 submissions. COCOON 2024 provided an excellent venue for researchers working in the area of algorithms, theory of computation, computational complexity, and combinatorics related to computing. 

Keywords

Table of contents (45 papers)

  1. Regular Papers Part I

    1. Almost Optimum \(\ell \)-Covering of \(\mathbb {Z}_n\)

      • Ke Shi, Chao Xu
      Pages 482-493

    2. The Communication Complexity of Distributed Maximization

      • Yuxiang Tian, Xiaoyi Zhu, Zengfeng Huang
      Pages 494-504

    3. Approximately Covering Vertices by Order-5 or Longer Paths

      • Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang
      Pages 505-517

    4. An FPT Constant-Factor Approximation Algorithm for Correlation Clustering

      • Jianqi Zhou, Zhongyi Zhang, Jiong Guo
      Pages 518-530

    5. A Little Aggression Goes a Long Way

      • Jyothi Krishnan, Neeldhara Misra, Saraswati Girish Nanoti
      Pages 531-543

    6. Monotone Properties of Uncertain Graphs

      • Xinjue Gao, Kaiyuan Zhou, Hao Li
      Pages 544-555

    7. Algorithms for 2-Balanced Connected k-Partition Problem in Graphs

      • Jing Hu, Junran Yu, Xiaoyan Zhang
      Pages 556-567

  2. Back Matter

    Pages 569-573
    Download chapter PDF
Back to top

Other volumes

  1. Computing and Combinatorics

  2. Computing and Combinatorics

  3. Computing and Combinatorics

Editors and Affiliations

  • Hangzhou Dianzi University, Hangzhou, China

    Yong Chen, An Zhang

  • Shanghai Jiao Tong University, Shanghai, China

    Xiaofeng Gao

  • Chinese Academy of Sciences, Beijing, China

    Xiaoming Sun

Bibliographic Information

Publish with us

Policies and ethics

Back to top