


default search action
17th COCOA 2024: Beijing, China - Part I
- Donglei Du, Lu Han, Dachuan Xu:

Combinatorial Optimization and Applications - 17th International Conference, COCOA 2024, Beijing, China, December 6-8, 2024, Proceedings, Part I. Lecture Notes in Computer Science 15434, Springer 2025, ISBN 978-981-96-4444-5 - Yi Zhao, Juan Gao, Chunming Xu:

An Optimization Strategy for Fresh Agricultural Product Supply Chain with Altruistic Preference Under Blockchain Technology. 1-17 - Jiafeng Xiong, Zhaohui Liu, Wei Yu:

Approximation Algorithms for the Capacitated Min-Max and Minimum Graph Cover Problems. 18-30 - Lishi Yu

, Zhiyi Tan
:
A Simple Algorithm for Scheduling Unit Jobs with Unknown Number of Machines. 31-43 - Ahmed Hossain, Md. Hasanul Islam, Debajyoti Mondal

, Md. Saidur Rahman
:
Faster Algorithms for Grid and Layered Drawings of Plane 3-Trees. 44-55 - Zhicheng Yao, Wenguo Yang:

Reinforcement Learning for Airline Continuous Dynamic Pricing. 56-68 - Li Guan, Hongli Liu, Xin Liu:

Approximation Algorithms for the Combination of Prize-Collecting Vertex Cover and Scheduling. 69-76 - Meng Xu, Qian Liu, Min Li, Yang Zhou:

Randomized Mechanisms for Improved Approximation Ratios in Heterogeneous Two-Facility Location. 77-87 - Bin Xiao, Jipeng Guo

, Juntao Hu, Yifan Dong, Youqing Wang
:
Comprehensive Multi-view Subspace Clustering with Global-and-Local Representation Learning. 88-99 - Muhammad Anwarul Azim

, Sk Ruhul Azgor
, Sadia Sharmin
, Md. Saidur Rahman
:
On the Twin-width of Outerplanar Graphs. 100-112 - Fanqing Meng, Qingqin Nong

, Suning Gong, Xiaoying Qu:
Maximize an Approximate k-submodular Function under a Knapsack Constraint. 113-126 - Peng Zhang

:
A Short Proof and Experimental Study of the Approximation Algorithm for Label s-t Cut. 127-138 - Jiaming Hu, Boon-Han Lim, Maowen Lu, Xiaoyun Tian, Dongzhao Wang, Wenqing Xu:

Risk-Embedded Scheduling Optimization for a Virtual Power Plant Under Carbon Emission Trading Constraints. 139-150 - Junran Lichen, Shuwen Ge, Runtao Xie, Ping Yang:

On the Constrained Steiner Strong Connectivity Augmentation Problem. 151-162 - Qian Liu, An Zhang

, Kai Wang, Yong Chen, Guangting Chen:
Competitive Algorithms for Online Traveling Salesman Problem on a Semi-line. 163-175 - Shunzhang Lu, An Zhang

, Mengyuan Hu, Yong Chen, Guangting Chen:
On the Inapproximability of Two-machine Open Shop Scheduling with Exact Delays. 176-189 - Chensheng Ma

, Zhao Zhang
:
Minimum Power Partial Cover with Fairness Constraint. 190-199 - Jesse Campbell, Chunjiang Zhu:

Differentially Private Counting Queries on Approximate Shortest Paths. 200-212 - Mingyang Gong, Guohui Lin, Zhiyi Tan:

Semi-online Multiprocessor Scheduling with Known Largest Job Processing Time. 213-225 - Qiaojun Shu, Guohui Lin:

Acyclically Edge Color Triangle-free Toroidal Graphs in $\varDelta + 2$ Colors. 226-239 - Ding Zou, Jiayi Lian, Wei Lu, Yichao Duan, Xingyu Lu, Jun Zhou, Yuchen Mao, Guochuan Zhang:

An Equally-Split Bin Packing Problem. 240-252 - Xiaoting Shang, Bowen Miao, Qingguo Bai:

The Location-routing Problem in the Pallet Pooling System Considering Carbon Emissions. 253-266 - Junyi Zhang, Juan Zou, Mingyu Ma:

Scheduling Fully Parallel Jobs with Integer Units. 267-277 - Yang Lv

, Guochao Fan, Mengzhen Li, Xiongjun Liu, Pengqing Liu, Yapu Zhang:
UAV Target Tracking with Bandit-Based Data Fusion. 278-286 - Shuqian Zhu, Longkun Guo

, Jiawei Lin
:
Fair Maximization of Monotone Submodular Functions in Data Streams. 287-298 - Kamal Santra

:
Tournament Transitivity of Graphs. 299-310 - Yuebo Huang, Sai Ji, Xiaoyun Tian, Kun Zhou:

Approximation Algorithm for Min-max Correlation Clustering Problem with Penalties. 311-323 - Di Wu, Qilong Feng, Jinhui Xu, Jian-Xin Wang:

Improved Approximation Algorithm for Individual Fairness k-Median. 324-337 - Tingwei Hu, Lili Mei, Zhen Wang, Guochuan Zhang:

The Price of Fairness for Budget-Feasible EF1 Allocations. 338-351 - Jianping Li, Ping Yang, Junran Lichen:

On the Min-max Heterogeneous Weighted Delivery Problem. 352-363 - Yang Yang, Yicheng Xu:

Exact and Approximate Heuristics for the Multi-modal Stable Matching with Applications in Industry Chains. 364-375 - Hongyang Zhang

, Wenchang Luo
:
Budget Feasible Mechanism for a k-submodular Function in the Clock Auction Model. 376-387 - Hanchun Yuan

, Zhen Zhang
:
Kernel for Proper Helly Circular-Arc Vertex Deletion: Smaller and Simpler via Graph Isomorphism. 388-400 - Hanlu Ye, Heqing Li, Min Li, Yang Zhou, Qian Liu:

Approximately Non-k-submodular Maximization Under p-System and ℓ Knapsack Constraints$^\star $. 401-412 - Cong Li, Suixiang Gao, Wenguo Yang, Zhipeng Jiang:

Alternating Lagrangian Decomposition Combining with Branch and Pricing for Robust and Integrated Airline Aircraft Routing and Crew Pairing. 413-425 - Minh Nguyen Triet, Le Khanh Bang, Hong Vo Khanh, The Nguyen Anh, Doan Minh Hieu, Nghiem Pham Thanh, Khiem Huynh Gia, Nam Tran Ba:

A Comparative Analysis of NFT-Based Insurance Claim Management Systems Across EVM-Compatible Blockchain Platforms. 426-438 - Gleb Polevoy

, Jonas Schweichhart:
Attaining Equilibria Using Control Sets. 439-452 - Wenhua Li, Liang Zhang, Ran Lin, Shisheng Li:

Scheduling on Parallel-batch Machines with Rejection and Resource Matching. 453-464 - Zhuo Diao

, Haoyang Zou:
Some Combinatorial Algorithms on the Independent Number of k-Regular Connected Hypergraphs. 465-476 - Zhongzheng Tang, Yaxuan Li, Zhuo Diao

:
Approximation Algorithms on k-Correlation Clustering of Uniform Hypergraphs. 477-486

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














