Combinatorial Optimization and Applications
-
Combinatorial Optimization and Applications: Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings
By Boting Yangand external referees (listed in the proceedings)for their excellent work,and the two invited speakers.
-
Combinatorial Optimization and Applications: 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011, Proceedings
By Ding-Zhu Du, Weifan Wang, Xuding ZhuThis book constitutes the refereed proceedings of the 5th International Conference on Combinatorial Optimization and Applications, COCOA 2011, held in Zhangjiajie, China, in August 2011.
-
Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II
By Weili Wu, Ovidiu Daescu4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II Weili Wu, ... we study the Constrained Surface-level Gateway Placement (C-SGP) problem for 3-D underwater acoustic sensor ...
-
Combinatorial Optimization and Applications: 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011, Proceedings
By Ding-Zhu Du, Weifan Wang, Xuding Zhu[10], authors put forward a formalized Russian Cards protocol, which can be used in unconditionally secured communication. In this paper, we first correct a couple of small flaws in the algorithm presented in [10] and give an improved ...
-
Combinatorial Optimization and Applications: 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings
By Ding-Zhu Du, Zhao Zhang, Wen XuAs defined in [2], a partial n-sun is the graph H, obtained from C, by appending a leaf to each vertex in some U C V(Cn), and a segment of H, refers to any maximal subset of consecutive vertices in U. By a generalized partial n-sun, ...
-
Combinatorial Optimization and Applications: 14th International Conference, COCOA 2020, Dallas, TX, USA, December 11–13, 2020, Proceedings
By Weili Wu, Zhongnan ZhangBakken, O.R.: Arrangement problems parameterized by neighbourhood diversity. ... Brandstädt, A., Spinard, J.P., Le, V.B.: Graph Classes: A Survey, volume 3. ... Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics, vol. 56.
-
Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II
By Xiaofeng Gao, Hongwei Du, Meng HanGiven any simple graph G = (V,E), one can find a graph G = (V ,E) with special nodes s, t and a color mapping cV : V\{s,t} ... Actually, above statement is just the positive answer for the decision problem of corresponding problem.
-
Combinatorial Optimization and Applications: 10th International Conference, COCOA 2016, Hong Kong, China, December 16–18, 2016, Proceedings
By Lusheng Wang, T-H. Hubert Chan, Minming Li... left shift of δ where δ = min{δl ,δr}, where δl = d l − Cηl and δr = d r − Cηr. Apparently, any left shift of δ ensures that we do not skip over any job while checking for Property 3. However, depending on the position of the due ...
-
Combinatorial Optimization and Applications: 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings
By Alexander Zelikovsky, Donghyun Kim, R. N. Uma... algorithm is FFD(I) ≤ 11/9OPT(I)+6/9. In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, pp. 1–11 (2007) 3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness ...
-
Combinatorial Optimization and Applications: First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings
By Binhai Zhu, Andreas Dress, Yinfeng Xu... combinatorial optimization problems whose classic versions are polynomial-time solvable (e.g., network flow problems) ... Combinatorics, Algorithms, Probabilistic and Experimental methodologies (to appear, 2007) 8. Cormen, T.H., Leiserson ...