Ausgabe 4/2019
Inhalt (17 Artikel)
Approximation algorithms for distance constraint sweep coverage with base stations
Jian Liang, Xiaohui Huang, Zhao Zhang
Improved bounds for the greedy strategy in optimization problems with curvature
Yajing Liu, Edwin K. P. Chong, Ali Pezeshki
An approximation algorithm for genome sorting by reversals to recover all adjacencies
Shanshan Zhai, Peng Zhang, Daming Zhu, Weitian Tong, Yao Xu, Guohui Lin
Verifying a scheduling protocol of safety-critical systems
Meng Wang, Cong Tian, Nan Zhang, Zhenhua Duan, Hongwei Du
Speech corpora subset selection based on time-continuous utterances features
Luobing Dong, Qiumin Guo, Weili Wu
Open Access
Speed scaling on parallel processors with migration
Eric Angel, Evripidis Bampis, Fadi Kacem, Dimitrios Letsios
Efficient algorithms for computing one or two discrete centers hitting a set of line segments
Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu