Liang Zhao

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
An A* algorithm framework for the point-to-point time-dependent shortest path problem
Lecture Notes in Computer Science
2011-11-11Paper
A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem
Information Processing Letters
2009-03-23Paper
An Efficient Algorithm for Generating Colored Outerplanar Graphs
Lecture Notes in Computer Science
2007-11-13Paper
Greedy splitting algorithms for approximating multiway partition problems
Mathematical Programming. Series A. Series B
2005-03-17Paper
On generalized greedy splitting algorithms for multiway partition problems
Discrete Applied Mathematics
2004-11-23Paper
A unified framework for approximating multiway partition problems (Extended abstract)
Lecture Notes in Computer Science
2004-08-04Paper
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
Discrete Applied Mathematics
2003-03-09Paper
scientific article; zbMATH DE number 1788731 (Why is no real title available?)2002-08-26Paper
scientific article; zbMATH DE number 1789187 (Why is no real title available?)2002-08-26Paper
A primal-dual approximation algorithm for the survivable network design problem in hypergraph
Lecture Notes in Computer Science
2002-01-09Paper
Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
Journal of Combinatorial Optimization
2002-01-08Paper
Approximating the minimum k-way cut in a graph via minimum 3-way cuts
Lecture Notes in Computer Science
2000-10-30Paper


Research outcomes over time


This page was built for person: Liang Zhao