Skip to main content


Journal of Combinatorial Optimization

Journal of Combinatorial Optimization 2/2020

Ausgabe 2/2020

Inhaltsverzeichnis ( 18 Artikel )

29.10.2019 | Ausgabe 2/2020

Price of dependence: stochastic submodular maximization with dependent items

Shaojie Tang

30.10.2019 | Ausgabe 2/2020 Open Access

The average covering tree value for directed graph games

Anna Khmelnitskaya, Özer Selçuk, Dolf Talman

28.10.2019 | Ausgabe 2/2020

On the edge metric dimension of convex polytopes and its related graphs

Yuezhong Zhang, Suogang Gao

31.10.2019 | Ausgabe 2/2020

The Wiener index of hypergraphs

Xiangxiang Liu, Ligong Wang, Xihe Li

07.11.2019 | Ausgabe 2/2020

On the zero forcing number of a graph involving some classical parameters

Shuchao Li, Wanting Sun

02.11.2019 | Ausgabe 2/2020

A new approximate cluster deletion algorithm for diamond-free graphs

Sabrine Malek, Wady Naanaa

20.11.2019 | Ausgabe 2/2020

On the total neighbour sum distinguishing index of graphs with bounded maximum average degree

H. Hocquard, J. Przybyło

16.11.2019 | Ausgabe 2/2020

Domination and matching in power and generalized power hypergraphs

Yanxia Dong, Moo Young Sohn, Zuosong Liang

30.11.2019 | Ausgabe 2/2020

Nontrivial path covers of graphs: existence, minimization and maximization

Renzo Gómez, Yoshiko Wakabayashi

29.11.2019 | Ausgabe 2/2020

Degree bounded bottleneck spanning trees in three dimensions

Patrick J. Andersen, Charl J. Ras

30.11.2019 | Ausgabe 2/2020

Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem

Jianping Li, Suding Liu, Junran Lichen, Wencheng Wang, Yujie Zheng

28.11.2019 | Ausgabe 2/2020

A new upper bound on the work function algorithm for the k-server problem

Wenming Zhang, Yongxi Cheng

09.12.2019 | Ausgabe 2/2020

Research on the impact of green innovation alliance mode on decision-making of two-cycle closed-loop supply chain

Chunmei Ma, Dan Huang

07.12.2019 | Ausgabe 2/2020

A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA–VNS algorithm

Wenjuan Fan, Yi Wang, Tongzhu Liu, Guixian Tong

02.12.2019 | Ausgabe 2/2020

Equitable partition of graphs into induced linear forests

Xin Zhang, Bei Niu

12.12.2019 | Ausgabe 2/2020

On alternating paths and the smallest positive eigenvalue of trees

Sonu Rani, Sasmita Barik

03.01.2019 | Ausgabe 2/2020

A new leader guided optimization for the flexible job shop problem

Fraj Naifar, Mariem Gzara, Moalla Taicir Loukil

21.06.2019 | Ausgabe 2/2020

Local search strikes again: PTAS for variants of geometric covering and packing

Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan

Aktuelle Ausgaben

Premium Partner