Liang Zhao

Available identifiers

Publication	Date of Publication	Type
An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem	2011-11-11	Paper
A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem	2009-03-23	Paper
An Efficient Algorithm for Generating Colored Outerplanar Graphs	2007-11-13	Paper
Greedy splitting algorithms for approximating multiway partition problems	2005-03-17	Paper
On generalized greedy splitting algorithms for multiway partition problems	2004-11-23	Paper
https://portal.mardi4nfdi.de/entity/Q4474133	2004-08-04	Paper
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs	2003-03-09	Paper
https://portal.mardi4nfdi.de/entity/Q4548331	2002-08-26	Paper
https://portal.mardi4nfdi.de/entity/Q4548783	2002-08-26	Paper
https://portal.mardi4nfdi.de/entity/Q2762526	2002-01-09	Paper
Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts	2002-01-08	Paper
https://portal.mardi4nfdi.de/entity/Q4511240	2000-10-30	Paper

This page was built for person: Liang Zhao