Author of the publication

Minmax Tree Cover in the Euclidean Space.

, , and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 202-213. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An extension of Hall's theorem for partitioned bipartite graphs.. Inf. Process. Lett., 116 (11): 706-709 (2016)Approximation algorithms to the capacitated tree-routings in networks.. Kyoto University, Japan, (2009)Approximation to the Minimum Cost Edge Installation Problem., and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 292-303. Springer, (2007)Approximating capacitated tree-routings in networks., and . J. Comb. Optim., 21 (2): 254-267 (2011)Genetic algorithms to balanced tree structures in graphs., and . Swarm Evol. Comput., (2017)Approximation Algorithms for Multicast Routings in a Network with Multi-Sources., and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 90-A (5): 900-906 (2007)Approximating the k-splittable capacitated network design problem.. Discret. Optim., (2016)Storage and search in dynamic peer-to-peer networks., , , , , and . SPAA, page 53-62. ACM, (2013)Approximation to the Minimum Cost Edge Installation Problem., and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 93-A (4): 778-786 (2010)Approximating Capacitated Tree-Routings in Networks., and . TAMC, volume 4484 of Lecture Notes in Computer Science, page 342-353. Springer, (2007)