Narrow search
Showing 1 - 5 of 5
Cover Image
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Cardinal, Jean; Demaine, Erik D.; Fiorini, Samuel; … - In: Journal of combinatorial optimization 25 (2013) 1, pp. 19-46
Persistent link: https://www.econbiz.de/10009727877
Cover Image
An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
Eskandarzadeh, Saman; Tavakkoli-Moghaddam, Reza; … - In: Journal of combinatorial optimization 17 (2009) 2, pp. 214-234
Persistent link: https://www.econbiz.de/10003849130
Cover Image
New algorithms for k-center and extensions
Brandenberg, René; Roth, Lucia Barbara - In: Journal of combinatorial optimization 18 (2009) 4, pp. 376-392
Persistent link: https://www.econbiz.de/10003938536
Cover Image
Separating sublinear time computations by approximate diameter
Fu, Bin; Zhao, Zhiyu - In: Journal of combinatorial optimization 18 (2009) 4, pp. 393-416
Persistent link: https://www.econbiz.de/10003938538
Cover Image
Point sets in the unit square and large areas of convex hulls of subsets of points
Lefmann, Hanno - In: Journal of combinatorial optimization 16 (2008) 2, pp. 182-195
Persistent link: https://www.econbiz.de/10003745130