The following pages link to Liang Zhao (Q221894):
Displaying 13 items.
- (Q588978) (redirect page) (← links)
- A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem (Q1007574) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- A primal-dual approximation algorithm for the survivable network design problem in hypergraphs (Q1861578) (← links)
- On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
- (Q2762526) (← links)
- An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem (Q3098082) (← links)
- (Q4474133) (← links)
- (Q4511240) (← links)
- (Q4548331) (← links)
- (Q4548783) (← links)
- An Efficient Algorithm for Generating Colored Outerplanar Graphs (Q5425469) (← links)
- Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts (Q5952050) (← links)
