Ausgabe 3/2017
Inhalt (20 Artikel)
Near optimal algorithms for online weighted bipartite matching in adversary model
Xiaoming Sun, Jia Zhang, Jialin Zhang
On the L(2, 1)-labeling conjecture for brick product graphs
Zehui Shao, Xiaosong Zhang, Huiqin Jiang, Bo Wang, Juanjuan He
Note on power propagation time and lower bounds for the power domination number
Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter, Michael Young
Neighbor-sum-distinguishing edge choosability of subcubic graphs
Jingjing Huo, Yiqiao Wang, Weifan Wang
Is there any polynomial upper bound for the universal labeling of graphs?
Arash Ahadi, Ali Dehghan, Morteza Saghafian
Optimization techniques for multivariate least trimmed absolute deviation estimation
G. Zioutas, C. Chatzinakos, T. D. Nguyen, L. Pitsoulis
Neighbor sum distinguishing index of 2-degenerate graphs
Xiaolan Hu, Yaojun Chen, Rong Luo, Zhengke Miao
A two-phase algorithm for bin stretching with stretching factor 1.5
Martin Böhm, Jiří Sgall, Rob van Stee, Pavel Veselý
Publisher's Erratum
Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5
Martin Böhm, Jiří Sgall, Rob van Stee, Pavel Veselý
The traveling salesman problem on grids with forbidden neighborhoods
Anja Fischer, Philipp Hungerländer
Nordhaus–Gaddum type result for the matching number of a graph
Huiqiu Lin, Jinlong Shu, Baoyindureng Wu
Multiple facility location on a network with linear reliability order of edges
Refael Hassin, R. Ravi, F. Sibel Salman
A simple approximation algorithm for minimum weight partial connected set cover
Yubai Zhang, Yingli Ran, Zhao Zhang