1. Single machine lot scheduling with optional job-rejection

   • Baruch Mor
   • Gur Mosheiov
   • Dana Shapira

   OriginalPaper 06 October 2020 Pages: 1 - 11

2. A randomized approximation algorithm for metric triangle packing

   • Yong Chen
   • Zhi-Zhong Chen
   • An Zhang

   OriginalPaper 13 October 2020 Pages: 12 - 27

   

3. Improved approximation algorithms for two-stage flexible flow shop scheduling

   • Anzhen Peng
   • Longcheng Liu
   • Weifeng Lin

   OriginalPaper 23 October 2020 Pages: 28 - 42

   

4. Sequence submodular maximization meets streaming

   • Ruiqi Yang
   • Dachuan Xu
   • Dongmei Zhang

   OriginalPaper 26 October 2020 Pages: 43 - 55

   

5. Secure Italian domination in graphs

   • M. Dettlaff
   • M. Lemańska
   • J. A. Rodríguez-Velázquez

   OriginalPaper Open access 28 October 2020 Pages: 56 - 72

   

6. Quaternary splitting algorithm in group testing

   • Jinn Lu
   • Hung-Lin Fu

   OriginalPaper 04 November 2020 Pages: 73 - 79

7. Top-k overlapping densest subgraphs: approximation algorithms and computational complexity

   • Riccardo Dondi
   • Mohammad Mehdi Hosseinzadeh
   • Italo Zoppis

   OriginalPaper Open access 04 November 2020 Pages: 80 - 104

   

8. The t-latency bounded strong target set selection problem in some kinds of special family of graphs

   • Xianliang Liu
   • Zishen Yang
   • Wei Wang

   OriginalPaper 10 November 2020 Pages: 105 - 117

   

9. A greedy algorithm for the fault-tolerant outer-connected dominating set problem

   • Xiaozhi Wang
   • Xianyue Li
   • Suogang Gao

   OriginalPaper 12 November 2020 Pages: 118 - 127

   

10. Non-monotone submodular function maximization under k-system constraint

    • Majun Shi
    • Zishen Yang
    • Wei Wang

    OriginalPaper 16 November 2020 Pages: 128 - 142

    

11. A scenario-based robust optimization with a pessimistic approach for nurse rostering problem

    • Mohammad Reza Hassani
    • J. Behnamian

    OriginalPaper 17 November 2020 Pages: 143 - 169

    

12. On multi-path routing for reliable communications in failure interdependent complex networks

    • Zishen Yang
    • Wei Wang
    • Donghyun Kim

    OriginalPaper 17 November 2020 Pages: 170 - 196

    

13. New construction of error-correcting pooling designs from singular linear spaces over finite fields

    • Gang Wang
    • You Gao

    OriginalPaper 25 November 2020 Pages: 197 - 212

14. Discount allocation for cost minimization in online social networks

    • Qiufen Ni
    • Smita Ghosh
    • Rong Jin

    OriginalPaper 26 November 2020 Pages: 213 - 233

    

15. On characterizations for subclasses of directed co-graphs

    • Frank Gurski
    • Dominique Komander
    • Carolin Rehs

    OriginalPaper Open access 27 November 2020 Pages: 234 - 266