Skip to main content
Springer Nature Link
Log in

Frontiers of Algorithmics

17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14–18, 2023 Proceedings

  • Conference proceedings
  • © 2023

Overview

Editors:
  1. Minming Li

    1. City University of Hong Kong, Hong Kong SAR, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Xiaoming Sun

    1. Chinese Academy of Sciences, Beijing, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Xiaowei Wu

    1. University of Macau, Macau, 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 13933)

Included in the following conference series:

Conference proceedings info: IJTCS-FAW 2023.

  • 8458 Accesses

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 64.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 book constitutes the refereed proceedings of the 17th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2023), consisting of the 17th International Conference on Frontier of Algorithmic Wisdom (FAW) and the 4th International Joint Conference on Theoretical Computer Science (IJTCS), held in Macau, China, during August 14–18, 2023.

FAW started as the Frontiers of Algorithmic Workshop in 2007 at Lanzhou, China, and was held annually from 2007 to 2021 and published archival proceedings. IJTCS, the International joint theoretical Computer Science Conference, started in 2020, aimed to bring in presentations covering active topics in selected tracks in theoretical computer science.

To accommodate the diversified new research directions in theoretical computer science, FAW and IJTCS joined their forces together to organize an event for information exchange of new findings and work of enduring value in the field. 
The 21 full papers included in this book were carefully reviewed and selected from 34 submissions. They were organized in topical sections as follows: algorithmic game theory; algorithms and data structures; combinatorial optimization; and computational economics.

Keywords

Table of contents (21 papers)

  1. Front Matter

    Pages i-xx
    Download chapter PDF

  2. Understanding the Relationship Between Core Constraints and Core-Selecting Payment Rules in Combinatorial Auctions

    • Robin Fritsch, Younjoo Lee, Adrian Meier, Ye Wang, Roger Wattenhofer
    Pages 1-14

  3. An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization

    • Zhongzheng Tang, Jingwen Chen, Chenhao Wang
    Pages 15-28

  4. Generalized Sorting with Predictions Revisited

    • T.-H. Hubert Chan, Enze Sun, Bo Wang
    Pages 29-41

  5. Eliciting Truthful Reports with Partial Signals in Repeated Games

    • Yutong Wu, Ali Khodabakhsh, Bo Li, Evdokia Nikolova, Emmanouil Pountourakis
    Pages 42-57

  6. On the NP-Hardness of Two Scheduling Problems Under Linear Constraints

    • Kameng Nip
    Pages 58-70

  7. On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree

    • Zhongzheng Tang, Haoyang Zou, Zhuo Diao
    Pages 71-84

  8. Max-Min Greedy Matching Problem: Hardness for the Adversary and Fractional Variant

    • T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue
    Pages 85-104

  9. Approximate Core Allocations for Edge Cover Games

    • Tianhang Lu, Han Xiao, Qizhi Fang
    Pages 105-115

  10. Random Approximation Algorithms for Monotone k-Submodular Function Maximization with Size Constraints

    • YuYing Li, Min Li, Yang Zhou, Qian Liu
    Pages 116-128

  11. Additive Approximation Algorithms for Sliding Puzzle

    • Zhixian Zhong
    Pages 129-146

  12. Differential Game Analysis for Cooperation Models in Automotive Supply Chain Under Low-Carbon Emission Reduction Policies

    • Yukun Cheng, Zhanghao Yao, Xinxin Wang
    Pages 147-159

  13. Adaptivity Gap for Influence Maximization with Linear Threshold Model on Trees

    • Yichen Tao, Shuo Wang, Kuan Yang
    Pages 160-170

  14. Physically Verifying the First Nonzero Term in a Sequence: Physical ZKPs for ABC End View and Goishi Hiroi

    • Suthee Ruangwises
    Pages 171-183

  15. Mechanism Design in Fair Sequencing

    • Zhou Chen, Yiming Ding, Qi Qi, Lingfei Yu
    Pages 184-194

  16. Red-Blue Rectangular Annulus Cover Problem

    • Sukanya Maji, Supantha Pandit, Sanjib Sadhu
    Pages 195-211

  17. Applying Johnson’s Rule in Scheduling Multiple Parallel Two-Stage Flowshops

    • Guangwei Wu, Fu Zuo, Feng Shi, Jianxin Wang
    Pages 212-224

  18. The Fair k-Center with Outliers Problem: FPT and Polynomial Approximations

    • Xiaoliang Wu, Qilong Feng, Jinhui Xu, Jianxin Wang
    Pages 225-238

  19. Constrained Graph Searching on Trees

    • Lusheng Wang, Boting Yang, Zhaohui Zhan
    Pages 239-251

  20. EFX Allocations Exist for Binary Valuations

    • Xiaolin Bu, Jiaxin Song, Ziqi Yu
    Pages 252-262
Back to top

Other volumes

  1. Frontiers of Algorithmics

Editors and Affiliations

  • City University of Hong Kong, Hong Kong SAR, China

    Minming Li

  • Chinese Academy of Sciences, Beijing, China

    Xiaoming Sun

  • University of Macau, Macau, China

    Xiaowei Wu

Bibliographic Information

Publish with us

Policies and ethics

Back to top