Ausgabe 3/2020
Inhalt (15 Artikel)
The complexity of symmetric connectivity in directional wireless sensor networks
Tien Tran, Dung T. Huynh
Compact quadratizations for pseudo-Boolean functions
Endre Boros, Yves Crama, Elisabeth Rodríguez-Heck
Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles
Feifeng Zheng, Yaxin Pang, Ming Liu, Yinfeng Xu
A primal-dual algorithm for the minimum partial set multi-cover problem
Yingli Ran, Yishuo Shi, Changbing Tang, Zhao Zhang
Algorithmic and complexity aspects of problems related to total Roman domination for graphs
Abolfazl Poureidi, Nader Jafari Rad
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
Vincent T’kindt, Lei Shang, Federico Della Croce
Solution of boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
Rupaj Kumar Nayak, Nirmalya Kumar Mohanty
Linear time algorithms for finding independent spanning trees on pyramid networks
Shuo-I Wang, Fu-Hsing Wang
Marginal contributions and derivatives for set functions in cooperative games
Daniel Li Li, Erfang Shan
Contrast in greyscales of graphs
Natalia de Castro, María A. Garrido-Vizuete, Rafael Robles, María Trinidad Villar-Liñán
3D camera sensor scheduling algorithms for indoor multi-objective tracking
Yi Hong, Yongcai Wang, Yuqing Zhu, Deying Li, Zhibo Chen, Jing Li
Fractional matching preclusion number of graphs and the perfect matching polytope
Ruizhi Lin, Heping Zhang