Kohei Okada

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2007
j2		Hiroshi Nagamochi, Kohei Okada: Approximating the minmax rooted-tree cover in a tree. Inf. Process. Lett. 104(5): 173-178 (2007)
c2		Kimio Oguchi, Kohei Okada, Shohei Terada, Kunio Tojo: New Optical VPN Configuration using Wavelength Routers in a WDM-Passive Optical Network. ICCCN 2007: 234-239
	2004
j1		Hiroshi Nagamochi, Kohei Okada: A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree. Discrete Applied Mathematics 140(1-3): 103-114 (2004)
	2003
c1		Hiroshi Nagamochi, Kohei Okada: Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem. ISAAC 2003: 138-147

Coauthor Index

Last update Mon May 20 05:37:03 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page