( en | de | ru )

 

Disambiguation of "Nagamochi, Hiroshi"

Author of the publication

copydeleteadd this publication to your clipboard
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem.

, , and . Inf. Process. Lett., 86 (2): 63-70 (2003)

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.

Hiroshi Murata

Hiroshi Kawabe

Hiroshi Kubota

Hiroshi Uchida

Hiroshi Fukuzaki

 

Other publications of authors with the same name

Practical Algorithms for Two-Dimensional Packing of Rectangles., , and . Handbook of Approximation Algorithms and Metaheuristics (1), Chapman and Hall/CRC, (2018)An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem., , , and . CGGA, volume 7033 of Lecture Notes in Computer Science, page 154-163. Springer, (2010)An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings.. Discret. Comput. Geom., 33 (4): 569-591 (2005)Bisecting Two Subsets in 3-Connected Graphs., , , and . ISAAC, volume 1741 of Lecture Notes in Computer Science, page 425-434. Springer, (1999)Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems., , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 55-64. Springer, (2009)On the Minimum Local-Vertex-Connectivity Augmentation in Graphs., and . ISAAC, volume 2223 of Lecture Notes in Computer Science, page 124-135. Springer, (2001)A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts., and . IPCO, volume 1610 of Lecture Notes in Computer Science, page 377-390. Springer, (1999)A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs., , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 228-240. Springer, (2015)Minmax Tree Cover in the Euclidean Space., , and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 202-213. Springer, (2009)A Detachment Algorithm for Inferring a Graph from Path Frequency.. COCOON, volume 4112 of Lecture Notes in Computer Science, page 274-283. Springer, (2006)