The Price of Anarchy of Generic Valid Utility Systems (English)
- New search for: Yang, Yin
- New search for: Nong, Qingqin
- New search for: Gong, Suning
- New search for: Du, Jingwen
- New search for: Liang, Yumei
- New search for: Du, Ding-Zhu
- Further information on Du, Ding-Zhu:
- https://orcid.org/https://orcid.org/0000-0002-7345-2185
- New search for: Du, Donglei
- Further information on Du, Donglei:
- https://orcid.org/https://orcid.org/0000-0003-0111-8572
- New search for: Wu, Chenchen
- Further information on Wu, Chenchen:
- https://orcid.org/https://orcid.org/0000-0002-6742-8816
- New search for: Xu, Dachuan
- New search for: Yang, Yin
- New search for: Nong, Qingqin
- New search for: Gong, Suning
- New search for: Du, Jingwen
- New search for: Liang, Yumei
In:
Combinatorial Optimization and Applications
: 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings
;
Chapter: 19
;
224-233
;
2021
- Article/Chapter (Book) / Electronic Resource
-
Title:The Price of Anarchy of Generic Valid Utility Systems
-
Additional title:Lect.Notes Computer
-
Contributors:Du, Ding-Zhu ( editor ) / Du, Donglei ( editor ) / Wu, Chenchen ( editor ) / Xu, Dachuan ( editor ) / Yang, Yin ( author ) / Nong, Qingqin ( author ) / Gong, Suning ( author ) / Du, Jingwen ( author ) / Liang, Yumei ( author )
-
Conference:International Conference on Combinatorial Optimization and Applications ; 2021 ; Tianjin, China
-
Published in:Combinatorial Optimization and Applications : 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings ; Chapter: 19 ; 224-233Lecture Notes in Computer Science ; 13135 ; 224-233
-
Publisher:
- New search for: Springer International Publishing
-
Place of publication:Cham
-
Publication date:2021-12-11
-
Size:10 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Routing Among Convex Polygonal Obstacles in the PlaneInkulu, R. / Kumar, Pawan et al. | 2021
- 2
-
Target Coverage with Minimum Number of Camera SensorsYao, Pei / Guo, Longkun / Li, Shuangjuan / Peng, Huihong et al. | 2021
- 3
-
Two-Stage Submodular Maximization Under CurvatureLi, Yanzhi / Liu, Zhicheng / Xu, Chuchu / Li, Ping / Chang, Hong / Zhang, Xiaoyan et al. | 2021
- 4
-
An Improved Approximation Algorithm for Capacitated Correlation Clustering ProblemJi, Sai / Cheng, Yukun / Tan, Jingjing / Zhao, Zhongrui et al. | 2021
- 5
-
The Selection of COVID-19 Epidemic Prevention and Control Programs Based on Group Decision MakingCui, Chunsheng / Li, Baiqiu / Wang, Liu et al. | 2021
- 6
-
Which Option Is a Better Way to Improve Transfer Learning Performance?Xu, Honghui / Cai, Zhipeng / Li, Wei et al. | 2021
- 7
-
On Maximizing the Difference Between an Approximately Submodular Function and a Linear Function Subject to a Matroid ConstraintWang, Yijing / Xu, Yicheng / Yang, Xiaoguang et al. | 2021
- 8
-
On Various Open-End Bin Packing GameGai, Ling / Zhang, Weiwei / Luo, Wenchang / Cheng, Yukun et al. | 2021
- 9
-
A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set FunctionsCui, Min / Du, Donglei / Gai, Ling / Yang, Ruiqi et al. | 2021
- 10
-
Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict ConstraintsZhang, An / Zhang, Liang / Chen, Yong / Chen, Guangting / Wang, Xing et al. | 2021
- 11
-
Computing the One-Visibility Cop-Win Strategies for TreesYang, Boting et al. | 2021
- 12
-
Complexity and Approximation Results on the Shared Transportation ProblemDavot, Tom / Giroudeau, Rodolphe / König, Jean-Claude et al. | 2021
- 13
-
The Complexity of Finding Optimal Subgraphs to Represent Spatial CorrelationEnright, Jessica / Lee, Duncan / Meeks, Kitty / Pettersson, William / Sylvester, John et al. | 2021
- 14
-
New Approximation Algorithms for the Rooted Budgeted Cycle Cover ProblemLi, Jiangkun / Zhang, Peng et al. | 2021
- 15
-
Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain SystemsChen, Jinmian / Cheng, Yukun / Xu, Zhiqi / Cao, Yan et al. | 2021
- 16
-
Efficient Algorithms for Scheduling Parallel Jobs with Interval Constraints in CloudsXu, Xuanming / Guo, Longkun et al. | 2021
- 17
-
Two-Stage Stochastic Max-Weight Independent Set ProblemsLi, Min / Liu, Qian / Zhou, Yang et al. | 2021
- 18
-
Routing and Scheduling Problems with Two Agents on a Line-Shaped NetworkYan, Hao / Lu, Xiwen et al. | 2021
- 19
-
The Price of Anarchy of Generic Valid Utility SystemsYang, Yin / Nong, Qingqin / Gong, Suning / Du, Jingwen / Liang, Yumei et al. | 2021
- 20
-
Single Machine Scheduling with Rejection and Generalized ParametersYu, Xue / Lu, Lingfa / Zhang, Liqi et al. | 2021
- 21
-
Approximation Algorithm and Hardness Results for Defensive Domination in GraphsHenning, Michael A. / Pandey, Arti / Tripathi, Vikash et al. | 2021
- 22
-
An Improved Physical ZKP for NonogramRuangwises, Suthee et al. | 2021
- 23
-
Finding All Leftmost Separators of Size \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\le k$$\end{document}Belbasi, Mahdi / Fürer, Martin et al. | 2021
- 24
-
Maximize the Probability of Union-Influenced in Social NetworksRao, Guoyao / Wang, Yongcai / Chen, Wenping / Li, Deying / Wu, Weili et al. | 2021
- 25
-
A Novel Algorithm for Max Sat Calling MOCE to OrderBerend, Daniel / Golan, Shahar / Twitto, Yochai et al. | 2021
- 26
-
The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-BranchingsGu, Ran / Gutin, Gregory / Li, Shasha / Shi, Yongtang / Taoqiu, Zhenyu et al. | 2021
- 27
-
Generalized Self-profit Maximization in Attribute NetworksDu, Liman / Yang, Wenguo / Gao, Suixiang et al. | 2021
- 28
-
Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy ClassesParanhos, Raffael M. / Nascimento Silva, Janio Carlos / Souza, Uéverton S. / Ochi, Luiz Satoru et al. | 2021
- 29
-
Maximization of Monotone Non-submodular Functions with a Knapsack Constraint over the Integer LatticeTan, Jingjing / Wang, Fengmin / Zhang, Xiaoqing / Zhou, Yang et al. | 2021
- 30
-
Sublinear-Time Reductions for Big Data ComputingGao, Xiangyu / Li, Jianzhong / Miao, Dongjing et al. | 2021
- 31
-
Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$l_{\infty }$$\end{document}-normLi, Xianyue / Yang, Ruowang / Zhang, Heping / Zhang, Zhao et al. | 2021
- 32
-
Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover ProblemsSun, Yuhui / Yu, Wei / Liu, Zhaohui et al. | 2021
- 33
-
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power GraphsChakraborty, Sankardeep / Jo, Seungbum / Sadakane, Kunihiko / Satti, Srinivasa Rao et al. | 2021
- 34
-
Streaming Submodular Maximization Under Differential Privacy NoiseXiao, Di / Guo, Longkun / Liao, Kewen / Yao, Pei et al. | 2021
- 35
-
Online Bottleneck Semi-matchingXiao, Man / Zhao, Shu / Li, Weidong / Yang, Jinhua et al. | 2021
- 36
-
Optimal Due Date Assignment Without Restriction and Convex Resource Allocation in Group Technology SchedulingChen, Ying / Cheng, Yongxi et al. | 2021
- 37
-
Constrained Stable Marriage with Free Edges or Few Blocking PairsWen, Yinghui / Guo, Jiong et al. | 2021
- 38
-
Backgammon Is HardWitter, R. Teal et al. | 2021
- 39
-
Two-Facility Location Games with a Minimum Distance Requirement on a CircleWu, Xiaoyu / Mei, Lili / Zhang, Guochuan et al. | 2021
- 40
-
Open Shop Scheduling Problem with a Non-resumable Flexible Maintenance PeriodYuan, Yuan / Han, Xin / Liu, Xinbo / Lan, Yan et al. | 2021
- 41
-
Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk GraphHong, Weizhi / Zhang, Zhao / Ran, Yingli et al. | 2021
- 42
-
An Improved Approximation Algorithm for Squared Metric k-Facility LocationZhang, Zhen / Feng, Qilong et al. | 2021
- 43
-
Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover NumberLiu, Yunlong / Li, Yixuan / Huang, Jingui et al. | 2021
- 44
-
The Fractional k-truncated Metric Dimension of GraphsYi, Eunjeong et al. | 2021
- 45
-
On Structural Parameterizations of the Offensive Alliance ProblemGaikwad, Ajinkya / Maity, Soumen et al. | 2021
- 46
-
On the k-colored Rainbow Sets in Fixed DimensionsKeikha, Vahideh / Keikha, Hamidreza / Mohades, Ali et al. | 2021
- 47
-
Cycle-Connected Mixed Graphs and Related ProblemsLichen, Junran et al. | 2021
- 48
-
Directed Width Parameters on Semicomplete DigraphsGurski, Frank / Komander, Dominique / Rehs, Carolin / Wiederrecht, Sebastian et al. | 2021
- 49
-
Improved Parameterized Approximation for Balanced k-MedianZhang, Zhen / Feng, Qilong et al. | 2021
- 50
-
A LP-based Approximation Algorithm for generalized Traveling Salesperson Path ProblemSun, Jian / Gutin, Gregory / Zhang, Xiaoyan et al. | 2021
- 51
-
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal GraphsGoyal, Pooja / Panda, B. S. et al. | 2021
- 52
-
Approximation Algorithm for Min-Max Correlation Clustering Problem with OutliersJi, Sai / Li, Min / Liang, Mei / Zhang, Zhenning et al. | 2021
- 53
-
Delay-Constrained Minimum Shortest Path Trees and Related ProblemsLichen, Junran / Cai, Lijian / Li, Jianping / Liu, Suding / Pan, Pengxiang / Wang, Wencheng et al. | 2021
- 54
-
On the Feedback Number of 3-Uniform Linear Extremal HypergraphsTang, Zhongzheng / Tang, Yucong / Diao, Zhuo et al. | 2021
- 55
-
A Multi-pass Streaming Algorithm for Regularized Submodular MaximizationGong, Qinqin / Gao, Suixiang / Wang, Fengmin / Yang, Ruiqi et al. | 2021