An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time Long ZhangYuzhong ZhangQingguo Bai OriginalPaper 27 May 2020 Pages: 2167 - 2179
Approximation approach for robust vessel fleet deployment problem with ambiguous demands E. ZhangFeng ChuYang Sui OriginalPaper 30 May 2020 Pages: 2180 - 2194
A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) Yinling WangYan LanYong Piao OriginalPaper 05 June 2020 Pages: 2195 - 2206
Due date assignment and two-agent scheduling under multitasking environment Yongjian YangGuangqiang YinYunqiang Yin OriginalPaper 08 June 2020 Pages: 2207 - 2223
Truthful mechanism design for bin packing with applications on cloud computing Deshi YeFeng XieGuochuan Zhang OriginalPaper 09 June 2020 Pages: 2224 - 2245
Online economic ordering problem for deteriorating items with limited price information Wenqiang DaiMeng ZhengZhuolin Yang OriginalPaper 11 June 2020 Pages: 2246 - 2268
Parameterized algorithms and complexity for the traveling purchaser problem and its variants Mingyu XiaoJianan ZhangWeibo Lin OriginalPaper 17 June 2020 Pages: 2269 - 2285
Principal–agent problem under the linear contract Guichen GaoXinxin HanYong Zhang OriginalPaper 25 March 2021 Pages: 2286 - 2301
Intersections and circuits in sets of line segments Boris BrimkovJesse GenesonPouria Salehi Nowbandegani OriginalPaper 10 April 2021 Pages: 2302 - 2323
Regularized graph cuts based discrete tomography reconstruction methods Marina MarčetaTibor Lukić OriginalPaper 10 April 2021 Pages: 2324 - 2346
Relative-perfectness of discrete gradient vector fields and multi-parameter persistent homology Claudia LandiSara Scaramuccia OriginalPaper Open access 13 April 2021 Pages: 2347 - 2374
The spherical k-means++ algorithm via local search scheme Xiaoyun TianDachuan XuLing Gai OriginalPaper 20 April 2021 Pages: 2375 - 2394
1-Attempt parallel thinning Kálmán PalágyiGábor Németh OriginalPaper 24 April 2021 Pages: 2395 - 2409
An approximation algorithm for the spherical k-means problem with outliers by local search Yishui WangChenchen WuJuan Zou OriginalPaper 25 April 2021 Pages: 2410 - 2422
Further steps on the reconstruction of convex polyominoes from orthogonal projections Paolo DulioAndrea FrosiniLaurent Vuillon OriginalPaper Open access 12 May 2021 Pages: 2423 - 2442
Data source selection for approximate query Hongjie GuoJianzhong LiHong Gao OriginalPaper 24 May 2021 Pages: 2443 - 2459
A data structure for efficiently managing a set of energy functions Jacques CarlierAntoine JougletAbderrahim Sahli OriginalPaper 05 June 2021 Pages: 2460 - 2481
A new lower bound for the eternal vertex cover number of graphs Jasine BabuVeena Prabhakaran OriginalPaper 12 June 2021 Pages: 2482 - 2498
Approximation algorithms with constant ratio for general cluster routing problems Xiaoyan ZhangDonglei DuJian Sun OriginalPaper 25 June 2021 Pages: 2499 - 2514
An integrated model for medical expense system optimization during diagnosis process based on artificial intelligence algorithm He HuangPo-Chou ShihWei Gao OriginalPaper 26 June 2021 Pages: 2515 - 2532
Improved local search algorithms for Bregman k-means and its variants Xiaoyun TianDachuan XuDan Wu OriginalPaper 28 June 2021 Pages: 2533 - 2550
The enforcement of ECA regulations: inspection strategy for on-board fuel sampling Lingyue LiSuixiang GaoWenguo Yang OriginalPaper 28 June 2021 Pages: 2551 - 2576
Study on the incentive and coordination mechanism of tumor healthcare alliance based on evolutionary game Gengjun GaoZhen WuShuyun Wang OriginalPaper 29 June 2021 Pages: 2577 - 2597
Nonsubmodular constrained profit maximization from increment perspective Liman DuShengminjie ChenWenguo Yang OriginalPaper 05 July 2021 Pages: 2598 - 2625
Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty Jian SunHaiyun ShengXiaoyan Zhang OriginalPaper 21 July 2021 Pages: 2626 - 2641
Local routing in a tree metric 1-spanner Milutin BrankovicJoachim GudmundssonAndré van Renssen OriginalPaper 23 July 2021 Pages: 2642 - 2660
Characterizing slope regions Rocio Gonzalez-DiazDarshan BataviaWalter G. Kropatsch OriginalPaper Open access 27 July 2021 Pages: 2661 - 2680
Constructing tree decompositions of graphs with bounded gonality Hans L. BodlaenderJosse van Dobben de BruynHarry Smit OriginalPaper Open access 02 August 2021 Pages: 2681 - 2699
Uniform Voronoi tessellation of digital manifolds: a GPU-based algorithm with applications to remeshing Ashutosh SoniPartha Bhowmick OriginalPaper 04 August 2021 Pages: 2700 - 2728
Surface polygonization of 3D objects using norm similarity Somrita SahaArindam Biswas OriginalPaper 06 August 2021 Pages: 2729 - 2747
Optimal frequency assignment and planar list L(2, 1)-labeling Haiyang ZhuJunlei ZhuLianying Miao OriginalPaper 11 August 2021 Pages: 2748 - 2761
W[1]-hardness of the k-center problem parameterized by the skeleton dimension Johannes Blum OriginalPaper Open access 12 August 2021 Pages: 2762 - 2781
An integrated method for hybrid distribution with estimation of demand matching degree Ling GaiYing JinBinyuan Zhang OriginalPaper 20 August 2021 Pages: 2782 - 2808
A new metric to compare local community detection algorithms in social networks using geodesic distance Sahar BakhtarHovhannes A. Harutyunyan OriginalPaper 24 August 2021 Pages: 2809 - 2831
1-line minimum rectilinear steiner trees and related problems Jianping LiJunran LichenYujie Zheng OriginalPaper 26 August 2021 Pages: 2832 - 2852
HM-EIICT: Fairness-aware link prediction in complex networks using community information Akrati SaxenaGeorge FletcherMykola Pechenizkiy OriginalPaper Open access 27 August 2021 Pages: 2853 - 2870
On the enumeration of minimal non-pairwise compatibility graphs Naveed Ahmed AzamAleksandar ShurbevskiHiroshi Nagamochi OriginalPaper 01 September 2021 Pages: 2871 - 2892
On the restricted k-Steiner tree problem Prosenjit BoseAnthony D’AngeloStephane Durocher OriginalPaper 21 September 2021 Pages: 2893 - 2918
Measuring the influence and amplification of users on social network with unsupervised behaviors learning and efficient interaction-based knowledge graph Quan M. TranHien D. NguyenVuong T. Pham OriginalPaper 11 October 2021 Pages: 2919 - 2945
Bicriteria streaming algorithms to balance gain and cost with cardinality constraint Yijing WangDachuan XuYanjun Jiang OriginalPaper 02 November 2021 Pages: 2946 - 2962
On zero-error codes produced by greedy algorithms Marcin Jurkiewicz OriginalPaper Open access 02 November 2021 Pages: 2963 - 2980
TLHSA and SACA: two heuristic algorithms for two variant VRP models Xuhong CaiLi JiangHongwei Du OriginalPaper 15 November 2021 Pages: 2996 - 3022
Unfolding H-convex Manhattan Towers Lydie RichaumeEric AndresRita Zrour OriginalPaper 19 November 2021 Pages: 3023 - 3037
Strong Euler well-composedness Nicolas BoutryRocio Gonzalez-DiazEduardo Paluzo-Hildago OriginalPaper Open access 23 December 2021 Pages: 3038 - 3055
Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane Sanjana AgrawalR. Inkulu OriginalPaper 27 January 2022 Pages: 3056 - 3082
A study of feature representation via neural network feature extraction and weighted distance for clustering Lily SchleiderEduardo L. PasiliaoQipeng P. Zheng OriginalPaper 21 February 2022 Pages: 3083 - 3105
Computing a maximum clique in geometric superclasses of disk graphs Nicolas Grelier OriginalPaper Open access 25 March 2022 Pages: 3106 - 3135
The optimization of self-interference in wideband full-duplex phased array with joint transmit and receive beamforming Xiaoxin WangZhipeng JiangSuixiang Gao OriginalPaper 01 April 2022 Pages: 3136 - 3152
Triangle packing and covering in dense random graphs Zhongzheng TangZhuo Diao OriginalPaper 25 April 2022 Pages: 3153 - 3164
