Ausgabe 4/2017
Inhalt (19 Artikel)
A lower bound for the adaptive two-echelon capacitated vehicle routing problem
Liang Song, Hao Gu, Hejiao Huang
Optimal RSUs deployment with delay bound along highways in VANET
Chunyan Liu, Hejiao Huang, Hongwei Du
Maximum flows in generalized processing networks
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
Lambda number for the direct product of some family of graphs
Byeong Moon Kim, Yoomi Rho, Byung Chul Song
Optimal RSUs placement with delay bounded message dissemination in vehicular networks
Chunyan Liu, Hejiao Huang, Hongwei Du, Xiaohua Jia
Open Access
Approximation of knapsack problems with conflict and forcing graphs
Ulrich Pferschy, Joachim Schauer
Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable
Ying Bai, Xiangwen Li, Gexin Yu
A new graph parameter and a construction of larger graph without increasing radio k-chromatic number
Ushnish Sarkar, Avishek Adhikari
A new effective branch-and-bound algorithm to the high order MIMO detection problem
Ye Tian, Ke Li, Wei Yang, Zhiyong Li
A new upper bound for the online square packing problem in a strip
Guosong Yu, Yanling Mao, Jiaoliao Xiao
A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
Baruch Mor, Gur Mosheiov