default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th COCOA 2021: Tianjin, China
- Ding-Zhu Du
, Donglei Du, Chenchen Wu, Dachuan Xu:
Combinatorial Optimization and Applications - 15th International Conference, COCOA 2021, Tianjin, China, December 17-19, 2021, Proceedings. Lecture Notes in Computer Science 13135, Springer 2021, ISBN 978-3-030-92680-9 - R. Inkulu, Pawan Kumar:
Routing Among Convex Polygonal Obstacles in the Plane. 1-11 - Pei Yao, Longkun Guo, Shuangjuan Li, Huihong Peng:
Target Coverage with Minimum Number of Camera Sensors. 12-24 - Yanzhi Li, Zhicheng Liu, Chuchu Xu, Ping Li, Hong Chang, Xiaoyan Zhang:
Two-Stage Submodular Maximization Under Curvature. 25-34 - Sai Ji, Yukun Cheng, Jingjing Tan, Zhongrui Zhao:
An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem. 35-45 - Chunsheng Cui, Baiqiu Li, Liu Wang:
The Selection of COVID-19 Epidemic Prevention and Control Programs Based on Group Decision Making. 46-60 - Honghui Xu, Zhipeng Cai, Wei Li:
Which Option Is a Better Way to Improve Transfer Learning Performance? 61-74 - Yijing Wang, Yicheng Xu, Xiaoguang Yang:
On Maximizing the Difference Between an Approximately Submodular Function and a Linear Function Subject to a Matroid Constraint. 75-85 - Ling Gai, Weiwei Zhang, Wenchang Luo, Yukun Cheng:
On Various Open-End Bin Packing Game. 86-95 - Min Cui, Donglei Du, Ling Gai, Ruiqi Yang:
A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions. 96-110 - An Zhang, Liang Zhang, Yong Chen, Guangting Chen, Xing Wang:
Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints. 111-124 - Boting Yang:
Computing the One-Visibility Cop-Win Strategies for Trees. 125-139 - Tom Davot, Rodolphe Giroudeau, Jean-Claude König:
Complexity and Approximation Results on the Shared Transportation Problem. 140-151 - Jessica A. Enright, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester:
The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation. 152-166 - Jiangkun Li, Peng Zhang:
New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem. 167-179 - Jinmian Chen, Yukun Cheng, Zhiqi Xu, Yan Cao:
Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain Systems. 180-194 - Xuanming Xu, Longkun Guo:
Efficient Algorithms for Scheduling Parallel Jobs with Interval Constraints in Clouds. 195-202 - Min Li, Qian Liu, Yang Zhou:
Two-Stage Stochastic Max-Weight Independent Set Problems. 203-213 - Hao Yan, Xiwen Lu:
Routing and Scheduling Problems with Two Agents on a Line-Shaped Network. 214-223 - Yin Yang, Qingqin Nong, Suning Gong, Jingwen Du, Yumei Liang:
The Price of Anarchy of Generic Valid Utility Systems. 224-233 - Xue Yu, Lingfa Lu, Liqi Zhang:
Single Machine Scheduling with Rejection and Generalized Parameters. 234-246 - Michael A. Henning, Arti Pandey, Vikash Tripathi:
Approximation Algorithm and Hardness Results for Defensive Domination in Graphs. 247-261 - Suthee Ruangwises:
An Improved Physical ZKP for Nonogram. 262-272 - Mahdi Belbasi, Martin Fürer:
Finding All Leftmost Separators of Size $\le k$. 273-287 - Guoyao Rao, Yongcai Wang, Wenping Chen, Deying Li, Weili Wu:
Maximize the Probability of Union-Influenced in Social Networks. 288-301 - Daniel Berend, Shahar Golan, Yochai Twitto:
A Novel Algorithm for Max Sat Calling MOCE to Order. 302-317 - Ran Gu, Gregory Z. Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu:
The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-Branchings. 318-332 - Liman Du, Wenguo Yang, Suixiang Gao:
Generalized Self-profit Maximization in Attribute Networks. 333-347 - Raffael M. Paranhos, Janio Carlos Nascimento Silva, Uéverton S. Souza, Luiz Satoru Ochi:
Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy Classes. 348-363 - Jingjing Tan, Fengmin Wang, Xiaoqing Zhang, Yang Zhou:
Maximization of Monotone Non-submodular Functions with a Knapsack Constraint over the Integer Lattice. 364-373 - Xiangyu Gao, Jian-Zhong Li, Dongjing Miao:
Sublinear-Time Reductions for Big Data Computing. 374-388 - Xianyue Li, Ruowang Yang, Heping Zhang, Zhao Zhang:
Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l∞ -norm. 389-399 - Yuhui Sun, Wei Yu, Zhaohui Liu:
Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems. 400-415 - Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. 416-430 - Di Xiao, Longkun Guo, Kewen Liao, Pei Yao:
Streaming Submodular Maximization Under Differential Privacy Noise. 431-444 - Man Xiao, Shu Zhao, Weidong Li, Jinhua Yang:
Online Bottleneck Semi-matching. 445-455 - Ying Chen, Yongxi Cheng:
Optimal Due Date Assignment Without Restriction and Convex Resource Allocation in Group Technology Scheduling. 456-467 - Yinghui Wen, Jiong Guo:
Constrained Stable Marriage with Free Edges or Few Blocking Pairs. 468-483 - R. Teal Witter:
Backgammon Is Hard. 484-496 - Xiaoyu Wu, Lili Mei, Guochuan Zhang:
Two-Facility Location Games with a Minimum Distance Requirement on a Circle. 497-511 - Yuan Yuan, Xin Han, Xinbo Liu, Yan Lan:
Open Shop Scheduling Problem with a Non-resumable Flexible Maintenance Period. 512-526 - Weizhi Hong, Zhao Zhang, Yingli Ran:
Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk Graph. 527-537 - Zhen Zhang, Qilong Feng:
An Improved Approximation Algorithm for Squared Metric k-Facility Location. 538-552 - Yunlong Liu, Yixuan Li, Jingui Huang:
Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover Number. 553-567 - Eunjeong Yi:
The Fractional k-truncated Metric Dimension of Graphs. 568-578 - Ajinkya Gaikwad, Soumen Maity:
On Structural Parameterizations of the Offensive Alliance Problem. 579-586 - Vahideh Keikha, Hamidreza Keikha, Ali Mohades:
On the k-colored Rainbow Sets in Fixed Dimensions. 587-601 - Junran Lichen:
Cycle-Connected Mixed Graphs and Related Problems. 602-614 - Frank Gurski, Dominique Komander, Carolin Rehs, Sebastian Wiederrecht:
Directed Width Parameters on Semicomplete Digraphs. 615-628 - Zhen Zhang, Qilong Feng:
Improved Parameterized Approximation for Balanced k-Median. 629-640 - Jian Sun, Gregory Z. Gutin, Xiaoyan Zhang:
A LP-based Approximation Algorithm for generalized Traveling Salesperson Path Problem. 641-652 - Pooja Goyal, B. S. Panda:
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs. 653-667 - Sai Ji, Min Li, Mei Liang, Zhenning Zhang:
Approximation Algorithm for Min-Max Correlation Clustering Problem with Outliers. 668-675 - Junran Lichen, Lijian Cai, Jianping Li, Suding Liu, Pengxiang Pan, Wencheng Wang:
Delay-Constrained Minimum Shortest Path Trees and Related Problems. 676-686 - Zhongzheng Tang, Yucong Tang, Zhuo Diao:
On the Feedback Number of 3-Uniform Linear Extremal Hypergraphs. 687-700 - Qinqin Gong, Suixiang Gao, Fengmin Wang, Ruiqi Yang:
A Multi-pass Streaming Algorithm for Regularized Submodular Maximization. 701-711
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.
last updated on 2025-01-15 20:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
