Error-correcting codes based on partial linear maps of finite-dimensional vector spaces Junli LiuWei JiangXuedong Zhang OriginalPaper 19 August 2022 Pages: 1377 - 1386
A sustainable supply chain network considering lot sizing with quantity discounts under disruption risks: centralized and decentralized models Parisa RafighAli Akbar AkbariAli Husseinzadeh Kashan OriginalPaper 27 August 2022 Pages: 1387 - 1432
On metric dimension of plane graphs with \(\frac{m}{2}\) number of 10 sided faces Sunny Kumar SharmaVijay Kumar Bhat OriginalPaper 28 August 2022 Pages: 1433 - 1458
An approximation algorithm for a general class of multi-parametric optimization problems Stephan HelfrichArne HerzelClemens Thielen OriginalPaper Open access 30 August 2022 Pages: 1459 - 1494
Improved algorithms for ranking and unranking (k, m)-ary trees in B-order Yu-Hsuan ChangRo-Yu WuJou-Ming Chang OriginalPaper 11 November 2019 Pages: 1495 - 1510
Fast computation of global solutions to the single-period unit commitment problem Cheng LuZhibin DengWenxun Xing OriginalPaper 29 November 2019 Pages: 1511 - 1536
Energy-efficient weak-barrier coverage with adaptive sensor rotation Catalina Aranzazu-SuescunMihaela Cardei OriginalPaper 04 December 2019 Pages: 1537 - 1555
Robustly assigning unstable items Ananya ChristmanChristine ChungDavid S. Yuen OriginalPaper 06 January 2020 Pages: 1556 - 1577
From packing rules to cost-sharing mechanisms Chenhao ZhangGuochuan Zhang OriginalPaper 10 January 2020 Pages: 1578 - 1593
Computing an \(L_1\) shortest path among splinegonal obstacles in the plane Tameem ChoudhuryR. Inkulu OriginalPaper 13 January 2020 Pages: 1594 - 1614
On the approximability of Time Disjoint Walks Alexandre BayenJesse GoodmanEugene Vinitsky OriginalPaper 14 January 2020 Pages: 1615 - 1636
A balm: defend the clique-based attack from a fundamental aspect Meng HanDongjing MiaoLiyuan Liu OriginalPaper 30 January 2020 Pages: 1637 - 1658
Isolation branching: a branch and bound algorithm for the k-terminal cut problem Mark VelednitskyDorit S. Hochbaum OriginalPaper 07 February 2020 Pages: 1659 - 1679
An approximation algorithm for stochastic multi-level facility location problem with soft capacities Chenchen WuDonglei DuYue Kang OriginalPaper 11 February 2020 Pages: 1680 - 1692
The bi-criteria seeding algorithms for two variants of k-means problem Min Li OriginalPaper 12 February 2020 Pages: 1693 - 1704
On weak Pareto optimality of nonatomic routing networks Xujin ChenZhuo DiaoXiaodong Hu OriginalPaper 15 February 2020 Pages: 1705 - 1723
Related machine scheduling with machine speeds satisfying linear constraints Siyun ZhangKameng NipZhenbo Wang OriginalPaper 15 February 2020 Pages: 1724 - 1740
Computation and algorithm for the minimum k-edge-connectivity of graphs Yuefang SunChenchen WuZhao Zhang OriginalPaper 15 February 2020 Pages: 1741 - 1752
Approximation algorithms for the maximally balanced connected graph tripartition problem Guangting ChenYong ChenAn Zhang OriginalPaper 17 February 2020 Pages: 1753 - 1773
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length Junran LichenJianping LiXingxing Yu OriginalPaper 17 February 2020 Pages: 1774 - 1795
Randomized selection algorithm for online stochastic unrelated machines scheduling Xiaoyan ZhangRan MaZan-Bo Zhang OriginalPaper 18 February 2020 Pages: 1796 - 1811
An approximation algorithm for the uniform capacitated k-means problem Lu HanDachuan XuDongmei Zhang OriginalPaper 25 February 2020 Pages: 1812 - 1823
Max–min dispersion on a line Tetsuya ArakiShin-ichi Nakano OriginalPaper 25 February 2020 Pages: 1824 - 1830
Analysis of consensus sorting via the cycle metric Ivan AvramovicDana S. Richards OriginalPaper 02 March 2020 Pages: 1831 - 1847
Tighter price of anarchy for selfish task allocation on selfish machines Xiayan ChengRongheng LiYunxia Zhou OriginalPaper 06 March 2020 Pages: 1848 - 1879
An approximation algorithm for the maximum spectral subgraph problem Cristina BazganPaul BeaujeanÉric Gourdin OriginalPaper 09 March 2020 Pages: 1880 - 1899
Online scheduling on a single machine with linear deteriorating processing times and delivery times Xing ChaiWenhua LiLibo Wang OriginalPaper 09 March 2020 Pages: 1900 - 1912
A primal-dual algorithm for the minimum power partial cover problem Menghong LiYingli RanZhao Zhang OriginalPaper 07 April 2020 Pages: 1913 - 1923
Weighted thresholding homotopy method for sparsity constrained optimization Wenxing ZhuHuating HuangJianli Chen OriginalPaper 08 April 2020 Pages: 1924 - 1952
Capacitated vehicle routing problem on line with unsplittable demands Yuanxiao WuXiwen Lu OriginalPaper 08 April 2020 Pages: 1953 - 1963
Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties Xiaofei LiuWeidong Li OriginalPaper 08 April 2020 Pages: 1964 - 1976
The seeding algorithm for spherical k-means clustering with penalties Sai JiDachuan XuDongmei Zhang OriginalPaper 15 April 2020 Pages: 1977 - 1994
Bipartite communities via spectral partitioning Kelly B. YanceyMatthew P. Yancey OriginalPaper 25 April 2020 Pages: 1995 - 2028
Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs Changhong LuQingjie YeChengru Zhu OriginalPaper 25 April 2020 Pages: 2029 - 2039
General restricted inverse assignment problems under \(l_1\) and \(l_\infty \) norms Qin WangTianyu YangLongshu Wu OriginalPaper 29 April 2020 Pages: 2040 - 2055
Computing equilibrium in network utility-sharing and discrete election games Rahul SwamyTimothy Murray OriginalPaper 02 May 2020 Pages: 2056 - 2084
Exact algorithms for finding constrained minimum spanning trees Pei YaoLongkun Guo OriginalPaper 05 May 2020 Pages: 2085 - 2103
The price of fairness for a two-agent scheduling game minimizing total completion time Yubai ZhangZhao ZhangZhaohui Liu OriginalPaper 17 May 2020 Pages: 2104 - 2122
Atomic congestion games with random players: network equilibrium and the price of anarchy Chenlan WangXuan Vinh DoanBo Chen OriginalPaper Open access 24 May 2020 Pages: 2123 - 2142
Online traveling salesman problem with time cost and non-zealous server Tengyu WuLin HeHaiyan Yu OriginalPaper 25 May 2020 Pages: 2143 - 2166
