734 results on '"Lin, Guohui"'
Search Results
2. Widen the debate: What is the academic community’s perception on ChatGPT?
3. A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops
4. Planar graphs are acyclically edge $(\Delta + 5)$-colorable
5. Randomized algorithms for fully online multiprocessor scheduling with testing
6. An Approximation Algorithm for Covering Vertices by 4^+-Paths
7. Directed Path Partition Problem on Directed Acyclic Graphs
8. An Approximation Algorithm for Covering Vertices by -Paths
9. Planar graphs are acyclically edge (Δ+5)-colorable
10. An Approximation Algorithm for Covering Vertices by $$4^+$$-Paths
11. Approximation algorithms for covering vertices by long paths
12. Path Cover Problems with Length Cost
13. An efficient polynomial-time approximation scheme for parallel multi-stage open shops
14. Bi-objective carbon-efficient distributed flow-shop scheduling with multistep electricity pricing.
15. Polynomial-time equivalences and refined algorithms for longest common subsequence variants
16. Approximation algorithms for the directed path partition problems
17. Approximating the directed path partition problem
18. On Computing a Center Persistence Diagram
19. Independent Set Under a Change Constraint from an Initial Solution
20. Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
21. A local search 4/3-approximation algorithm for the minimum 3-path partition problem
22. Approximation algorithms for maximally balanced connected graph partition
23. On Computing a Center Persistence Diagram
24. Intensity-dependent mass search for improving metabolite database matches in chemical isotope labeling LC-QTOF-MS-based metabolomics
25. On Computing a Center Persistence Diagram
26. Approximation algorithms for the maximally balanced connected graph tripartition problem
27. A local search $4/3$-approximation algorithm for the minimum $3$-path partition problem
28. Improved approximation algorithms for path vertex covers in regular graphs
29. Approximation algorithms for the three-machine proportionate mixed shop scheduling
30. Path Cover Problems with Length Cost
31. Improved Approximation Algorithms for Multiprocessor Scheduling with Testing
32. Approximation Algorithms for the Directed Path Partition Problems
33. Experimental study on slagging monitoring of pulverized coal-fired boiler based on slagging image
34. Machine learning classification of plant genotypes grown under different light conditions through the integration of multi-scale time-series data
35. Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
36. A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
37. Planar graphs are acyclically edge $$(\Delta + 5)$$-colorable
38. Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
39. Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
40. Approximation Algorithms for Maximally Balanced Connected Graph Partition
41. A $(1.4 + \epsilon)$-approximation algorithm for the $2$-Max-Duo problem
42. A local search 2.917-approximation algorithm for duo-preservation string mapping
43. On rescheduling due to machine disruption while to minimize the total weighted completion time
44. Parameterized algorithms for the Happy Set problem
45. An improved approximation algorithm for the minimum common integer partition problem
46. Improved Approximation Algorithms for Multiprocessor Scheduling with Testing
47. Approximation Algorithms for the Directed Path Partition Problems
48. Path Cover Problems with Length Cost
49. Graph Classes and Approximability of the Happy Set Problem
50. Improved Hardness and Approximation Results for Single Allocation Hub Location
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.