Ausgabe 4/2020
Inhalt (16 Artikel)
Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect
Dexin Zou, Chong Jiang, Weiwei Liu
Open Access
A characterization of optimal multiprocessor schedules and new dominance rules
Rico Walter, Alexander Lawrinenko
A short proof for stronger version of DS decomposition in set function optimization
Xiang Li, H. George Du
General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number
Tomáš Vetrík, Selvaraj Balachandran
Open Access
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
Zhiwei Guo, Hajo Broersma, Ruonan Li, Shenggui Zhang
A linear time algorithm for the p-maxian problem on trees with distance constraint
Trung Kien Nguyen, Nguyen Thanh Hung, Huong Nguyen-Thu
Minimizing maximum delivery completion time for order scheduling with rejection
Ren-Xia Chen, Shi-Sheng Li
An approximation algorithm for submodular hitting set problem with linear penalties
Shaojing Du, Suogang Gao, Bo Hou, Wen Liu
Maximizing user type diversity for task assignment in crowdsourcing
Ana Wang, Meirui Ren, Hailong Ma, Lichen Zhang, Peng Li, Longjiang Guo
Open Access
The maximum Wiener index of maximal planar graphs
Debarun Ghosh, Ervin Győri, Addisu Paulos, Nika Salia, Oscar Zamora