Lee R.C.T.

R.C.T. Lee

Information about the author R.C.T. Lee will soon be added to the site.
Found 8 papers in total
Two-machine flow-shop scheduling to minimize total late work
Two-machine flow-shop scheduling to minimize total late work
2006
This article considers a two-machine flow-shop scheduling problem of minimizing total...
The minimal spanning tree preservation approaches for DNA multiple sequence alignment and evolutionary tree construction
The minimal spanning tree preservation approaches for DNA multiple sequence alignment and evolutionary tree construction
2004
In this paper, we propose a new criterion, namely the minimal spanning tree...
An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
2000
Given a permutation graph G with its corresponding permutation π, we present an...
A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
1994
In this paper, the authors consider the weighted perfect domination problem in...
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs
1992
In this paper, the authors discuss the Euclidean bottleneck biconnected edge subgraph...
Transformation completeness properties of SVPC transformation sets
Transformation completeness properties of SVPC transformation sets
1991
A set T of permutations of a finite set is said to be transformation complete if the...
Rectilinear m-center problem
Rectilinear m-center problem
1990
In this article the authors consider the unweighted m- center problem with rectilinear...
A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
1989
Dolev and Warmuth proposed a dynamic programming approach with time complexity O( n h...
Papers per page: