Ausgabe 1/2015
Special Issue: Combinatorics and Computing
Inhalt (19 Artikel)
A combination of flow shop scheduling and the shortest path problem
Kameng Nip, Zhenbo Wang, Fabrice Talla Nobibon, Roel Leus
An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
Chenchen Wu, Donglei Du, Dachuan Xu
Improved lower bounds for the online bin packing problem with cardinality constraints
Hiroshi Fujiwara, Koji Kobayashi
Open Access
Computing the shortest reset words of synchronizing automata
Andrzej Kisielewicz, Jakub Kowalski, Marek Szykuła
Randomized parameterized algorithms for -Packing and Co-Path Packing problems
Qilong Feng, Jianxin Wang, Shaohua Li, Jianer Chen
Improved approximation algorithms for computing disjoint paths subject to two constraints
Longkun Guo, Hong Shen, Kewen Liao
On the sequential price of anarchy of isolation games
Anna Angelucci, Vittorio Bilò, Michele Flammini, Luca Moscardelli
Packing cubes into a cube is NP-complete in the strong sense
Yiping Lu, Danny Z. Chen, Jianzhong Cha
Complexity analysis and algorithms for the Program Download Problem
Chao Peng, Jie Zhou, Binhai Zhu, Hong Zhu
An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen
The -separator problem: polyhedra, complexity and approximation results
Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto