Ausgabe 3/2019
Inhalt (18 Artikel)
Extremal digraphs for an upper bound on the Roman domination number
Lyes Ouldrabah, Mostafa Blidia, Ahmed Bouchou
Improved approximation algorithms for the combination problem of parallel machine scheduling and path
Li Guan, Jianping Li, Weidong Li, Junran Lichen
On perfect Roman domination number in trees: complexity and bounds
Mahsa Darkooti, Abdollah Alhevaz, Sadegh Rahimi, Hadi Rahbani
A new lower bound on the domination number of a graph
Majid Hajian, Michael A. Henning, Nader Jafari Rad
Packing parameters in graphs: new bounds and a solution to an open problem
Doost Ali Mojdeh, Babak Samadi
Hybrid algorithms for placement of virtual machines across geo-separated data centers
Fernando Stefanello, Vaneet Aggarwal, Luciana S. Buriol, Mauricio G. C. Resende
The clique-perfectness and clique-coloring of outer-planar graphs
Zuosong Liang, Erfang Shan, Liying Kang
An evolutionary approach for the target search problem in uncertain environment
M. Barkaoui, J. Berger, A. Boukhtouta
Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach
Gergely Kovács, Benedek Nagy, Béla Vizvári
Characterizations of matroids with an element lying in a restricted number of circuits
Ping Li, Lan Wang, Yang Wu, Hong-Jian Lai
Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection
Shi-Sheng Li, Ren-Xia Chen, Qi Feng, Cheng-Wen Jiao
Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
Shih-Shun Kao, Kung-Jui Pai, Sun-Yuan Hsieh, Ro-Yu Wu, Jou-Ming Chang