Skip to main content
SpringerLink
Log in

Recent Research Activities on Algorithmic Foundations for Social Advancement

  • Conference paper
  • First Online:
WALCOM: Algorithms and Computation (WALCOM 2024)

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

Included in the following conference series:

  • 80 Accesses

Abstract

Algorithms, the theories, techniques and logical procedures of information processing, perform a key part of the recent sophisticated information society. A five-year nation-wide research project on algorithmic techniques, initiated in 2020, is currently in progress in Japan. This presentation aims to provide an overview of the “AFSA” (Algorithmic Foundations for Social Advancement) project and introduce some selected topics from our recent research activities.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Complexity year in review 2022 (2022). https://blog.computationalcomplexity.org/2022/12/

  2. Hanaka, T., Ono, H., Sugiyama, K.: Solving distance-constrained labeling problems for small diameter graphs via tsp\({}^{\text{*}}\). In: IEEE International Parallel and Distributed Processing Symposium, IPDPS 2023 - Workshops, St. Petersburg, FL, USA, 15–19 May 2023, pp. 308–313. IEEE (2023). https://doi.org/10.1109/IPDPSW59300.2023.00059

  3. Hirahara, S.: Np-hardness of learning programs and partial MCSP. In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, 31 October–3 November 2022, pp. 968–979. IEEE (2022). https://doi.org/10.1109/FOCS54457.2022.00095

  4. Inoue, T., Iwashita, H., Kawahara, J., Minato, S.: Graphillion: software library for very large sets of labeled graphs. Int. J. Softw. Tools Technol. Transf. 18(1), 57–66 (2016). https://doi.org/10.1007/S10009-014-0352-Z

  5. Inoue, T., et al.: Distribution loss minimization with guaranteed error bound. IEEE Trans. Smart Grid 5(1), 102–111 (2014)

    Article  Google Scholar 

  6. Inoue, T., Yasuda, N., Nabeshima, H., Nishino, M., Denzumi, S., Minato, S.: International competition on graph counting algorithms 2023. CoRR abs/2309.07381 (2023). https://doi.org/10.48550/ARXIV.2309.07381, https://doi.org/10.48550/arXiv.2309.07381

  7. Inoue, T., Yasuda, N., Nabeshima, H., Nishino, M., Denzumi, S., Minato, S.: International competition on graph counting algorithms 2023. IEICE Trans. Fundamentals (2024, to appear)

    Google Scholar 

  8. Inoue, T., et al.: Graphillion (2013). http://graphillion.org/

  9. Kawahara, J., Horiyama, T., Hotta, K., Minato, S.: Generating all patterns of graph partitions within a disparity bound. In: Proceedings of the 11th International Conference and Workshops on Algorithms and Computation, vol. 10167, pp. 119–131 (2017). https://doi.org/10.1007/978-3-319-53925-6_10

  10. Kawahara, J., Saitoh, T., Suzuki, H., Yoshinaka, R.: Solving the longest oneway-ticket problem and enumerating letter graphs by augmenting the two representative approaches with ZDDs. In: Phon-Amnuaisuk, S., Au, T.-W., Omar, S. (eds.) CIIS 2016. AISC, vol. 532, pp. 294–305. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-48517-1_26

    Chapter  Google Scholar 

  11. Kawarabayashi, K., Sidiropoulos, A.: Embeddings of planar quasimetrics into directed \( {l}\)1 and polylogarithmic approximation for directed sparsest-cut. In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, 7–10 February 2022, pp. 480–491. IEEE (2021). https://doi.org/10.1109/FOCS52979.2021.00055

  12. Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceedings of of 30th ACM/IEEE Design Automation Conference (DAC’93), pp. 272–277 (1993)

    Google Scholar 

  13. Minato, S., et al.: Creation and organization of innovative algorithmic foundations for social advancement. In: 2020–2024 Grant-in-Aid for Transformative Research Areas, MEXT, Japan (2020). https://afsa.jp/en/

  14. Nakamura, K., Inoue, T., Nishino, M., Yasuda, N., Minato, S.: A fast and exact evaluation algorithm for the expected number of connected nodes: an enhanced network reliability measure. In: IEEE INFOCOM 2023 - IEEE Conference on Computer Communications, New York City, NY, USA, 17–20 May 2023, pp. 1–10. IEEE (2023). https://doi.org/10.1109/INFOCOM53939.2023.10228897

  15. Yamamoto, A., Shibuya, T.: Efficient and highly accurate differentially private statistical genomic analysis using discrete Fourier transform. In: IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2022, Wuhan, China, 9–11 December 2022, pp. 525–532. IEEE (2022). https://doi.org/10.1109/TRUSTCOM56396.2022.00078

Download references

Acknowledgment

This work was partly supported by JSPS KAKENHI Grant Number JP20H05961, JP20H5962, JP20H05963, JP20H05964, JP20H5965, JP20H05966, JP20H05967.

Author information

Authors and Affiliations

  1. Kyoto University, Kyoto, Japan

    Shin-ichi Minato

Authors
  1. Shin-ichi Minato
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shin-ichi Minato .

Editor information

Editors and Affiliations

  1. Japan Advanced Institute of Science and Technology, Nomi, Japan

    Ryuhei Uehara

  2. Iwate University, Morioka, Japan

    Katsuhisa Yamanaka

  3. National Taiwan University, Taipei, Taiwan

    Hsu-Chun Yen

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Minato, Si. (2024). Recent Research Activities on Algorithmic Foundations for Social Advancement. In: Uehara, R., Yamanaka, K., Yen, HC. (eds) WALCOM: Algorithms and Computation. WALCOM 2024. Lecture Notes in Computer Science, vol 14549. Springer, Singapore. https://doi.org/10.1007/978-981-97-0566-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-981-97-0566-5_1

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-97-0565-8

  • Online ISBN: 978-981-97-0566-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation