The following pages link to Tien-Ching Lin (Q884470):
Displaying 13 items.
- Randomized algorithm for the sum selection problem (Q884471) (← links)
- Fast algorithms for the density finding problem (Q1024779) (← links)
- Finding maximum sum segments in sequences with uncertainty (Q2216439) (← links)
- Efficient algorithms for the sum selection problem and \(k\) maximum sums problem (Q2268857) (← links)
- Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane (Q3060767) (← links)
- Finding Maximum Sum Segments in Sequences with Uncertainty (Q3104675) (← links)
- The (1|1)-Centroid Problem in the Plane with Distance Constraints (Q3177899) (← links)
- Geometric Minimum Diameter Minimum Cost Spanning Tree Problem (Q3652215) (← links)
- Optimal Randomized Algorithm for the Density Selection Problem (Q3652287) (← links)
- The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints (Q4636550) (← links)
- COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE (Q4650090) (← links)
- Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem (Q5459141) (← links)
- Algorithms and Computation (Q5897884) (← links)
