Ausgabe 1/2019
Inhalt (18 Artikel)
Maximizing profit of multiple adoptions in social networks with a martingale approach
Bin Liu, Yuxia Yan, Qizhi Fang, Junyu Dong, Weili Wu, Huijuan Wang
The Best-or-Worst and the Postdoc problems with random number of candidates
L. Bayón, P. Fortuny, J. Grau, A. M. Oller-Marcén, M. M. Ruiz
Two-stage stochastic days-off scheduling of multi-skilled analysts with training options
Douglas S. Altner, Erica K. Mason, Les D. Servi
An improved approximation algorithm for the minimum 3-path partition problem
Yong Chen, Randy Goebel, Guohui Lin, Bing Su, Yao Xu, An Zhang
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
Mattia D’Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
Yulin Chang, Qiancheng Ouyang, Guanghui Wang
Model and algorithm of routes planning for emergency relief distribution in disaster management with disaster information update
Jianming Zhu, Shuyue Liu, Smita Ghosh
Open Access
Online interval scheduling on two related machines: the power of lookahead
Nicolas Pinson, Frits C. R. Spieksma
On the randomized online strategies for the k-Canadian traveler problem
Davood Shiri, F. Sibel Salman
Non-adaptive group testing on graphs with connectivity
Song Luo, Yuji Matsuura, Ying Miao, Maiko Shigeno