The following pages link to Guohui Lin (Q166205):
Displaying 50 items.
- Graph classes and approximability of the happy set problem (Q2019476) (← links)
- A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem (Q2023131) (← links)
- Improved hardness and approximation results for single allocation hub location (Q2039648) (← links)
- An improved approximation algorithm for the minimum common integer partition problem (Q2051801) (← links)
- Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← links)
- A local search 4/3-approximation algorithm for the minimum 3-path partition problem (Q2091113) (← links)
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- Path cover problems with length cost (Q2154120) (← links)
- A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling (Q2168763) (← links)
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
- Exact algorithms for the bounded repetition longest common subsequence problem (Q2180128) (← links)
- Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547) (← links)
- Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments (Q2215191) (← links)
- Linear time construction of 5-phylogenetic roots for tree chordal graphs (Q2268766) (← links)
- Approximation algorithms for the three-machine proportionate mixed shop scheduling (Q2283006) (← links)
- Single-machine scheduling with job-dependent machine deterioration (Q2294893) (← links)
- Rescheduling due to machine disruption to minimize the total weighted completion time (Q2317133) (← links)
- A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem (Q2327083) (← links)
- Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem'' (Q2357384) (← links)
- In memoriam: Yong He (1969--2005) (Q2385474) (← links)
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
- An approximation algorithm for genome sorting by reversals to recover all adjacencies (Q2424720) (← links)
- An improved approximation algorithm for the minimum 3-path partition problem (Q2424798) (← links)
- Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem (Q2464382) (← links)
- An improved approximation algorithm for multicast \(k\)-tree routing (Q2576773) (← links)
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops (Q2636494) (← links)
- Improved hardness and approximation results for single allocation hub location problems (Q2661760) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- (Q2723948) (← links)
- (Q2766831) (← links)
- Approximation Algorithms for the Maximum Multiple RNA Interaction Problem (Q2867107) (← links)
- An Improved Approximation Algorithm for the Bandpass Problem (Q2898009) (← links)
- Diameter-constrained Steiner trees (Q2905280) (← links)
- On the Smoothed Heights of Trie and Patricia Index Trees (Q2920448) (← links)
- Algorithms for Cut Problems on Trees (Q2942406) (← links)
- An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem (Q2942641) (← links)
- An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem (Q3004655) (← links)
- Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering (Q3066148) (← links)
- Diameter-Constrained Steiner Tree (Q3066462) (← links)
- Machine Scheduling with a Maintenance Interval and Job Delivery Coordination (Q3452556) (← links)
- Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive (Q3578379) (← links)
- Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting (Q3637052) (← links)
- Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem (Q3637083) (← links)
- On Rearrangeability of Multirate Clos Networks (Q4268705) (← links)
- (Q4368203) (← links)
- (Q4408109) (← links)
- (Q4472526) (← links)
- Reducing the Steiner problem in four uniform orientations (Q4506270) (← links)
- (Q4515737) (← links)
- (Q4535038) (← links)
