Ausgabe 1/2021
Inhalt (15 Artikel)
A randomized approximation algorithm for metric triangle packing
Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang
Improved approximation algorithms for two-stage flexible flow shop scheduling
Anzhen Peng, Longcheng Liu, Weifeng Lin
Open Access
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity
Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri, Italo Zoppis
The t-latency bounded strong target set selection problem in some kinds of special family of graphs
Xianliang Liu, Zishen Yang, Wei Wang
A greedy algorithm for the fault-tolerant outer-connected dominating set problem
Xiaozhi Wang, Xianyue Li, Bo Hou, Wen Liu, Lidong Wu, Suogang Gao
Non-monotone submodular function maximization under k-system constraint
Majun Shi, Zishen Yang, Donghyun Kim, Wei Wang
A scenario-based robust optimization with a pessimistic approach for nurse rostering problem
Mohammad Reza Hassani, J. Behnamian
On multi-path routing for reliable communications in failure interdependent complex networks
Zishen Yang, Wei Wang, Donghyun Kim
Discount allocation for cost minimization in online social networks
Qiufen Ni, Smita Ghosh, Chuanhe Huang, Weili Wu, Rong Jin
Open Access
On characterizations for subclasses of directed co-graphs
Frank Gurski, Dominique Komander, Carolin Rehs