Ausgabe 3/2022
Inhalt (40 Artikel)
Error-correcting codes based on partial linear maps of finite-dimensional vector spaces
Junli Liu, Wei Jiang, Xuedong Zhang
A sustainable supply chain network considering lot sizing with quantity discounts under disruption risks: centralized and decentralized models
Parisa Rafigh, Ali Akbar Akbari, Hadi Mohammadi Bidhandi, Ali Husseinzadeh Kashan
On metric dimension of plane graphs with number of 10 sided faces
Sunny Kumar Sharma, Vijay Kumar Bhat
An approximation algorithm for a general class of multi-parametric optimization problems
Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen
Improved algorithms for ranking and unranking (k, m)-ary trees in B-order
Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang
Fast computation of global solutions to the single-period unit commitment problem
Cheng Lu, Zhibin Deng, Shu-Cherng Fang, Qingwei Jin, Wenxun Xing
Energy-efficient weak-barrier coverage with adaptive sensor rotation
Catalina Aranzazu-Suescun, Mihaela Cardei
Robustly assigning unstable items
Ananya Christman, Christine Chung, Nicholas Jaczko, Scott Westvold, David S. Yuen
A balm: defend the clique-based attack from a fundamental aspect
Meng Han, Dongjing Miao, Jinbao Wang, Liyuan Liu
Isolation branching: a branch and bound algorithm for the k-terminal cut problem
Mark Velednitsky, Dorit S. Hochbaum
An approximation algorithm for stochastic multi-level facility location problem with soft capacities
Chenchen Wu, Donglei Du, Yue Kang
Related machine scheduling with machine speeds satisfying linear constraints
Siyun Zhang, Kameng Nip, Zhenbo Wang
Computation and algorithm for the minimum k-edge-connectivity of graphs
Yuefang Sun, Chenchen Wu, Xiaoyan Zhang, Zhao Zhang
Approximation algorithms for the maximally balanced connected graph tripartition problem
Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin, Tian Liu, An Zhang
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
Junran Lichen, Jianping Li, Ko-Wei Lih, Xingxing Yu
Randomized selection algorithm for online stochastic unrelated machines scheduling
Xiaoyan Zhang, Ran Ma, Jian Sun, Zan-Bo Zhang
An approximation algorithm for the uniform capacitated k-means problem
Lu Han, Dachuan Xu, Donglei Du, Dongmei Zhang
Tighter price of anarchy for selfish task allocation on selfish machines
Xiayan Cheng, Rongheng Li, Yunxia Zhou
An approximation algorithm for the maximum spectral subgraph problem
Cristina Bazgan, Paul Beaujean, Éric Gourdin
Online scheduling on a single machine with linear deteriorating processing times and delivery times
Xing Chai, Wenhua Li, Hang Yuan, Libo Wang
A primal-dual algorithm for the minimum power partial cover problem
Menghong Li, Yingli Ran, Zhao Zhang
Weighted thresholding homotopy method for sparsity constrained optimization
Wenxing Zhu, Huating Huang, Lanfan Jiang, Jianli Chen
The seeding algorithm for spherical k-means clustering with penalties
Sai Ji, Dachuan Xu, Longkun Guo, Min Li, Dongmei Zhang
Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs
Changhong Lu, Qingjie Ye, Chengru Zhu
Computing equilibrium in network utility-sharing and discrete election games
Rahul Swamy, Timothy Murray
The price of fairness for a two-agent scheduling game minimizing total completion time
Yubai Zhang, Zhao Zhang, Zhaohui Liu
Atomic congestion games with random players: network equilibrium and the price of anarchy
Chenlan Wang, Xuan Vinh Doan, Bo Chen
Online traveling salesman problem with time cost and non-zealous server
Tengyu Wu, Lin He, Haiyan Yu