105 results on '"Lin, Guohui"'
Search Results
2. Independent Set Under a Change Constraint from an Initial Solution
3. On Computing a Center Persistence Diagram
4. Improved Approximation Algorithms for Multiprocessor Scheduling with Testing
5. Approximation Algorithms for the Directed Path Partition Problems
6. Path Cover Problems with Length Cost
7. Graph Classes and Approximability of the Happy Set Problem
8. Parameterized Algorithms for the Happy Set Problem
9. Improved Hardness and Approximation Results for Single Allocation Hub Location
10. Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles
11. Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem
12. Approximation Algorithms for Maximally Balanced Connected Graph Partition
13. A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem
14. A Randomized Approximation Algorithm for Metric Triangle Packing
15. Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph
16. Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop
17. Open-Shop Scheduling for Unit Jobs Under Precedence Constraints
18. An Approximation Framework for Bounded Facility Location Problems
19. Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem
20. A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
21. Machine Scheduling with a Maintenance Interval and Job Delivery Coordination
22. Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems
23. An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem
24. On the Smoothed Heights of Trie and Patricia Index Trees
25. Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights
26. Algorithms for Cut Problems on Trees
27. Protein Contact Order Prediction: Update
28. Approximation Algorithms for the Maximum Multiple RNA Interaction Problem
29. Approximating the Minimum Independent Dominating Set in Perturbed Graphs
30. An Improved Approximation Algorithm for the Bandpass Problem
31. Sparse Learning Based Linear Coherent Bi-clustering
32. An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem
33. Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive
34. Diameter-Constrained Steiner Tree
35. Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering
36. Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting
37. Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem
38. Classification Accuracy Based Microarray Missing Value Imputation
39. Protein Structure Determination via NMR Spectral Data
40. Application of Smodels in Quartet Based Phylogeny Construction
41. A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem
42. 5-th Phylogenetic Root Construction for Strictly Chordal Graphs
43. Improved Approximation Algorithms for the Capacitated Multicast Routing Problem
44. More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling
45. A Space Efficient Algorithm for Sequence Alignment with Inversions
46. Improved Approximation Algorithms for NMR Spectral Peak Assignment
47. An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
48. Detecting Community Structure by Network Vectorization
49. Feature Extraction for Classification of Proteomic Mass Spectra: A Comparative Study
50. Machine Scheduling with a Maintenance Interval and Job Delivery Coordination.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.