Skip to main content

Journal of Combinatorial Optimization

Ausgabe 1/2017

Inhalt (22 Artikel)

The k-metric dimension

Ron Adar, Leah Epstein

Lawler’s minmax cost problem under uncertainty

Nadia Brauner, Gerd Finke, Yakov Shafransky

Neighbor sum distinguishing total coloring of 2-degenerate graphs

Jingjing Yao, Xiaowei Yu, Guanghui Wang, Changqing Xu

An exact semidefinite programming approach for the max-mean dispersion problem

Michele Garraffa, Federico Della Croce, Fabio Salassa

On zero-sum -magic graphs

J. P. Georges, D. Mauro, K. Wash

Modified linear programming and class 0 bounds for graph pebbling

Daniel W. Cranston, Luke Postle, Chenxiao Xue, Carl Yerger

Minimizing the number of tardy jobs in two-machine settings with common due date

Federico Della Croce, Christos Koulamas, Vincent T’kindt

On minimally 2-connected graphs with generalized connectivity

Shasha Li, Wei Li, Yongtang Shi, Haina Sun

Upper bounds of proper connection number of graphs

Fei Huang, Xueliang Li, Shujing Wang

Note on incidence chromatic number of subquartic graphs

Petr Gregor, Borut Lužar, Roman Soták

Characterizations of k-cutwidth critical trees

Zhen-Kun Zhang, Hong-Jian Lai

Total coloring of planar graphs without adjacent chordal 6-cycles

Huijuan Wang, Bin Liu, Xiaoli Wang, Guangmo Tong, Weili Wu, Hongwei Gao

Approximation algorithms for k-level stochastic facility location problems

Lucas P. Melo, Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery

Maximizing target-temporal coverage of mission-driven camera sensor networks

Yi Hong, Deying Li, Donghyun Kim, Wenping Chen, Jiguo Yu, Alade O. Tokuta

Local ratio method on partial set multi-cover

Yingli Ran, Yishuo Shi, Zhao Zhang

Centralized and decentralized rumor blocking problems

Xin Chen, Qingqin Nong, Yan Feng, Yongchang Cao, Suning Gong, Qizhi Fang, Ker-I Ko