Issue 2/2020
Content (18 Articles)
Open Access
The average covering tree value for directed graph games
Anna Khmelnitskaya, Özer Selçuk, Dolf Talman
On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
H. Hocquard, J. Przybyło
Domination and matching in power and generalized power hypergraphs
Yanxia Dong, Moo Young Sohn, Zuosong Liang
Nontrivial path covers of graphs: existence, minimization and maximization
Renzo Gómez, Yoshiko Wakabayashi
Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
Jianping Li, Suding Liu, Junran Lichen, Wencheng Wang, Yujie Zheng
A new upper bound on the work function algorithm for the k-server problem
Wenming Zhang, Yongxi Cheng
A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA–VNS algorithm
Wenjuan Fan, Yi Wang, Tongzhu Liu, Guixian Tong
A new leader guided optimization for the flexible job shop problem
Fraj Naifar, Mariem Gzara, Moalla Taicir Loukil
Local search strikes again: PTAS for variants of geometric covering and packing
Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan