Ausgabe 1/2016
Inhalt (28 Artikel)
Approximation for maximizing monotone non-decreasing set functions with a greedy method
Zengfu Wang, Bill Moran, Xuezhi Wang, Quan Pan
Erratum
Erratum to: -labeling and integer tension of a graph embedded on torus
Xiaoling Zhang, Jianguo Qian
Minimax regret vertex 2-sink location problem in dynamic path networks
Hongmei Li, Yinfeng Xu, Guanqun Ni
Algorithms for randomized time-varying knapsack problems
Yichao He, Xinlu Zhang, Wenbin Li, Xiang Li, Weili Wu, Suogang Gao
Information exchange with collision detection on multiple channels
Yuepeng Wang, Yuexuan Wang, Dongxiao Yu, Jiguo Yu, Francis C. M. Lau
A greedy algorithm for the minimum -connected -fold dominating set problem
Yishuo Shi, Yaping Zhang, Zhao Zhang, Weili Wu
Maximally edge-connected graphs and Zeroth-order general Randić index for
Guifu Su, Liming Xiong, Xiaofeng Su, Guojun Li
Some Motzkin–Straus type results for non-uniform hypergraphs
Ran Gu, Xueliang Li, Yuejian Peng, Yongtang Shi
Minimum-latency aggregation scheduling in wireless sensor network
Longjiang Guo, Yingshu Li, Zhipeng Cai
A simplex like approach based on star sets for recognizing convex- adverse graphs
Domingos M. Cardoso, Carlos J. Luz
Signed Roman edge domination numbers in graphs
H. Abdollahzadeh Ahangar, J. Amjadi, S. M. Sheikholeslami, L. Volkmann, Y. Zhao
Efficient algorithms for cluster editing
Lucas Bastos, Luiz Satoru Ochi, Fábio Protti, Anand Subramanian, Ivan César Martins, Rian Gabriel S. Pinheiro