Skip to main content


Journal of Combinatorial Optimization

Journal of Combinatorial Optimization 4/2020

Ausgabe 4/2020

Inhaltsverzeichnis ( 16 Artikel )

04.08.2020 | Ausgabe 4/2020

Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect

Dexin Zou, Chong Jiang, Weiwei Liu

10.08.2020 | Ausgabe 4/2020

Connected max cut is polynomial for graphs without the excluded minor

Brahim Chaourar

12.08.2020 | Ausgabe 4/2020 Open Access

A characterization of optimal multiprocessor schedules and new dominance rules

Rico Walter, Alexander Lawrinenko

19.08.2020 | Ausgabe 4/2020

A short proof for stronger version of DS decomposition in set function optimization

Xiang Li, H. George Du

26.08.2020 | Ausgabe 4/2020

Influence maximization problem: properties and algorithms

Wenguo Yang, Yapu Zhang, Ding-Zhu Du

01.09.2020 | Ausgabe 4/2020

New approximation algorithms for machine scheduling with rejection on single and parallel machine

Peihai Liu, Xiwen Lu

01.09.2020 | Ausgabe 4/2020

General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number

Tomáš Vetrík, Selvaraj Balachandran

03.09.2020 | Ausgabe 4/2020

Online maximum matching with recourse

Spyros Angelopoulos, Christoph Dürr, Shendan Jin

04.09.2020 | Ausgabe 4/2020 Open Access

Some algorithmic results for finding compatible spanning circuits in edge-colored graphs

Zhiwei Guo, Hajo Broersma, Ruonan Li, Shenggui Zhang

12.09.2020 | Ausgabe 4/2020

Intersecting families in

Jun Wang, Huajun Zhang

14.09.2020 | Ausgabe 4/2020

A linear time algorithm for the p-maxian problem on trees with distance constraint

Trung Kien Nguyen, Nguyen Thanh Hung, Huong Nguyen-Thu

16.09.2020 | Ausgabe 4/2020

Minimizing maximum delivery completion time for order scheduling with rejection

Ren-Xia Chen, Shi-Sheng Li

25.09.2020 | Ausgabe 4/2020

An approximation algorithm for submodular hitting set problem with linear penalties

Shaojing Du, Suogang Gao, Bo Hou, Wen Liu

27.09.2020 | Ausgabe 4/2020

Partial inverse min–max spanning tree problem

Javad Tayyebi, Ali Reza Sepasian

03.10.2020 | Ausgabe 4/2020

Maximizing user type diversity for task assignment in crowdsourcing

Ana Wang, Meirui Ren, Hailong Ma, Lichen Zhang, Peng Li, Longjiang Guo

03.10.2020 | Ausgabe 4/2020 Open Access

The maximum Wiener index of maximal planar graphs

Debarun Ghosh, Ervin Győri, Addisu Paulos, Nika Salia, Oscar Zamora

Aktuelle Ausgaben

Premium Partner