Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Kun-Mao Chao
Information about the author Kun-Mao Chao will soon be added to the site.
Found
3 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
On the generalized constrained longest common subsequence problems
2011
We investigate four variants of the longest common subsequence problem. Given two...
Approximation algorithms for some optimum communication spanning tree problems
2000
Let G =( V,E,w ) be an undirected graph with nonnegative edge length function w and...
A polynomial-time approximation scheme for minimum routing cost spanning trees
2000
Given an undirected graph with nonnegative costs on the edges, the routing cost of any...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
