Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuohui Lin
Guo-Hui Lin
Person information
- affiliation: University of Alberta, Edmonton, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j124]Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin
, Bing Su, An Zhang:
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. J. Comb. Optim. 43(3): 571-588 (2022)- [j123]Wenchang Luo, Rylan Chin, Alexander Cai, Guohui Lin, Bing Su, An Zhang:
A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling. J. Comb. Optim. 44(1): 690-722 (2022) - [j122]Mingyang Gong, Randy Goebel, Guohui Lin, Eiji Miyano:
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing. J. Comb. Optim. 44(1): 877-893 (2022) - [j121]Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin, Tian Liu, An Zhang:
Approximation algorithms for the maximally balanced connected graph tripartition problem. J. Comb. Optim. 44(3): 1753-1773 (2022) - [j120]Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang:
A local search 4/3-approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. 44(5): 3595-3610 (2022) - [c80]Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. CPM 2022: 15:1-15:17 - [c79]Mingyang Gong, Jing Fan, Guohui Lin, Eiji Miyano:
Approximation Algorithms for Covering Vertices by Long Paths. MFCS 2022: 53:1-53:14 - [c78]Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita:
Path Cover Problems with Length Cost. WALCOM 2022: 396-408 - [i18]Jianming Dong, Ruyan Jin, Guohui Lin, Bing Su, Weitian Tong, Yao Xu:
An efficient polynomial-time approximation scheme for parallel multi-stage open shops. CoRR abs/2205.14407 (2022) - [i17]Mingyang Gong, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano:
Approximation algorithms for covering vertices by long paths. CoRR abs/2208.03294 (2022) - 2021
- [j119]Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang:
Approximation Algorithms for Maximally Balanced Connected Graph Partition. Algorithmica 83(12): 3715-3740 (2021) - [j118]Jianming Dong, Randy Goebel, Jueliang Hu, Guohui Lin, Bing Su:
Minimizing total job completion time in MapReduce scheduling. Comput. Ind. Eng. 158: 107387 (2021) - [j117]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Parameterized algorithms for the Happy Set problem. Discret. Appl. Math. 304: 32-44 (2021) - [j116]Guohui Lin, Weitian Tong:
An improved approximation algorithm for the minimum common integer partition problem. Inf. Comput. 281: 104784 (2021) - [j115]Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang:
A randomized approximation algorithm for metric triangle packing. J. Comb. Optim. 41(1): 12-27 (2021) - [j114]Xing Wang, Guangting Chen, Yong Chen, Guohui Lin, Yonghao Wang, An Zhang:
Improved hardness and approximation results for single allocation hub location problems. Theor. Comput. Sci. 864: 10-19 (2021) - [j113]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Complexity and approximability of the happy set problem. Theor. Comput. Sci. 866: 123-144 (2021) - [j112]Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang:
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. Theor. Comput. Sci. 882: 77-108 (2021) - [c77]Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang:
Approximation Algorithms for the Directed Path Partition Problems. IJTCS-FAW 2021: 23-36 - [c76]Mingyang Gong, Guohui Lin:
Improved Approximation Algorithms for Multiprocessor Scheduling with Testing. IJTCS-FAW 2021: 65-77 - [i16]Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang:
Approximation algorithms for the directed path partition problems. CoRR abs/2107.04699 (2021) - 2020
- [j111]An Zhang, Yong Chen, Zhi-Zhong Chen, Guohui Lin:
Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs. Algorithmica 82(10): 3041-3064 (2020) - [j110]Wenchang Luo, Miaomiao Jin, Bing Su, Guohui Lin:
An approximation scheme for rejection-allowed single-machine rescheduling. Comput. Ind. Eng. 146: 106574 (2020) - [j109]Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang:
A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. J. Comb. Optim. 40(3): 806-824 (2020) - [j108]Jianming Dong, Joshua Chang, Bing Su, Jueliang Hu, Guohui Lin:
Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments. J. Sched. 23(5): 595-608 (2020) - [j107]Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, Yao Xu, An Zhang:
Approximation algorithms for the three-machine proportionate mixed shop scheduling. Theor. Comput. Sci. 803: 57-70 (2020) - [j106]Yong Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang:
Open-shop scheduling for unit jobs under precedence constraints. Theor. Comput. Sci. 803: 144-151 (2020) - [j105]Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Exact algorithms for the repetition-bounded longest common subsequence problem. Theor. Comput. Sci. 838: 238-249 (2020) - [c75]Xing Wang, Guangting Chen, Yong Chen, Guohui Lin, Yonghao Wang, An Zhang:
Improved Hardness and Approximation Results for Single Allocation Hub Location. AAIM 2020: 85-96 - [c74]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Graph Classes and Approximability of the Happy Set Problem. COCOON 2020: 335-346 - [c73]Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang:
Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles. TAMC 2020: 426-438 - [c72]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Parameterized Algorithms for the Happy Set Problem. WALCOM 2020: 323-328 - [i15]Qiaojun Shu, Guohui Lin, Eiji Miyano:
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. CoRR abs/2005.06152 (2020)
2010 – 2019
- 2019
- [j104]Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang:
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. Algorithmica 81(11-12): 4167-4199 (2019) - [j103]Huili Zhang, Weitian Tong, Guohui Lin, Yinfeng Xu:
Online minimum latency problem with edge uncertainty. Eur. J. Oper. Res. 273(2): 418-429 (2019) - [j102]Yuichi Asahiro, Guohui Lin, Zhilong Liu, Eiji Miyano:
An Approximation Algorithm for the Maximum Induced Matching Problem on C5-Free Regular Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1142-1149 (2019) - [j101]Jianming Dong, Ruyan Jin, Jueliang Hu, Guohui Lin:
A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops. J. Comb. Optim. 37(2): 668-684 (2019) - [j100]Shanshan Zhai, Peng Zhang, Daming Zhu, Weitian Tong, Yao Xu, Guohui Lin:
An approximation algorithm for genome sorting by reversals to recover all adjacencies. J. Comb. Optim. 37(4): 1170-1190 (2019) - [j99]Yong Chen, Randy Goebel, Guohui Lin, Bing Su, Yao Xu, An Zhang:
An improved approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. 38(1): 150-164 (2019) - [j98]Wenchang Luo, Yao Xu, Weitian Tong, Guohui Lin:
Single-machine scheduling with job-dependent machine deterioration. J. Sched. 22(6): 691-707 (2019) - [c71]Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA 2019: 1-12 - [c70]Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang:
A Randomized Approximation Algorithm for Metric Triangle Packing. COCOA 2019: 119-129 - [c69]Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang:
Approximation Algorithms for Maximally Balanced Connected Graph Partition. COCOA 2019: 130-141 - [c68]Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang:
A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem. FAW 2019: 14-25 - [c67]Lin Chen, Minming Li, Guohui Lin, Kai Wang:
Approximation of Scheduling with Calibrations on Multiple Machines (Brief Announcement). SPAA 2019: 237-239 - [i14]Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu:
On Computing a Center Persistence Diagram. CoRR abs/1910.01753 (2019) - [i13]Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang:
Approximation algorithms for maximally balanced connected graph partition. CoRR abs/1910.02470 (2019) - 2018
- [j97]Peng Zhang, Yao Xu, Tao Jiang, Angsheng Li, Guohui Lin, Eiji Miyano:
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. Algorithmica 80(5): 1412-1438 (2018) - [j96]Wenchang Luo, Yao Xu, Boyuan Gu, Weitian Tong, Randy Goebel, Guohui Lin:
Algorithms for Communication Scheduling in Data Gathering Network with Data Compression. Algorithmica 80(11): 3158-3176 (2018) - [j95]Wenchang Luo, Boyuan Gu, Guohui Lin:
Communication scheduling in data gathering networks of heterogeneous sensors with data compression: Algorithms and empirical experiments. Eur. J. Oper. Res. 271(2): 462-473 (2018) - [j94]Jianming Dong, Xueshi Wang, Jueliang Hu, Guohui Lin:
Single machine scheduling with job delivery to multiple customers. J. Sched. 21(3): 337-348 (2018) - [j93]Wenchang Luo, Taibo Luo, Randy Goebel, Guohui Lin:
Rescheduling due to machine disruption to minimize the total weighted completion time. J. Sched. 21(5): 565-578 (2018) - [j92]Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin:
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops. Theor. Comput. Sci. 734: 24-31 (2018) - [c66]Longcheng Liu, Guanqun Ni, Yong Chen, Randy Goebel, Yue Luo, An Zhang, Guohui Lin:
Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop. AAIM 2018: 268-280 - [c65]An Zhang, Yong Chen, Randy Goebel, Guohui Lin:
Open-Shop Scheduling for Unit Jobs Under Precedence Constraints. COCOA 2018: 329-340 - [c64]Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang:
Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph. COCOON 2018: 205-217 - [c63]Wenchang Luo, Bing Su, Yao Xu, Guohui Lin:
An Approximation Framework for Bounded Facility Location Problems. COCOON 2018: 353-364 - [i12]Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang:
Approximation algorithms for two-machine flow-shop scheduling with a conflict graph. CoRR abs/1803.02862 (2018) - [i11]Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, An Zhang:
Approximation algorithms for the three-machine proportionate mixed shop scheduling. CoRR abs/1809.05745 (2018) - [i10]An Zhang, Yong Chen, Zhi-Zhong Chen, Guohui Lin:
Improved approximation algorithms for path vertex covers in regular graphs. CoRR abs/1811.01162 (2018) - [i9]Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang:
A local search 4/3-approximation algorithm for the minimum 3-path partition problem. CoRR abs/1812.09353 (2018) - 2017
- [j91]Jianming Dong, Weitian Tong, Taibo Luo, Xueshi Wang, Jueliang Hu, Yinfeng Xu, Guohui Lin:
An FPTAS for the parallel two-stage flowshop problem. Theor. Comput. Sci. 657: 64-72 (2017) - [j90]Jianming Dong, Jueliang Hu, Mikhail Y. Kovalyov, Guohui Lin, Taibo Luo, Weitian Tong, Xueshi Wang, Yinfeng Xu:
Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72]. Theor. Comput. Sci. 687: 93-94 (2017) - [c62]Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang:
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. COCOON 2017: 124-136 - [c61]Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang:
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem. ISAAC 2017: 66:1-66:12 - [i8]Wenchang Luo, Taibo Luo, Randy Goebel, Guohui Lin:
On rescheduling due to machine disruption while to minimize the total weighted completion time. CoRR abs/1701.07498 (2017) - [i7]Yao Xu, Yong Chen, Taibo Luo, Guohui Lin:
A local search 2.917-approximation algorithm for duo-preservation string mapping. CoRR abs/1702.01877 (2017) - [i6]Yao Xu, Yong Chen, Taibo Luo, Guohui Lin:
A (1.4 + ε)-approximation algorithm for the 2-{Max-Duo} problem. CoRR abs/1702.06256 (2017) - 2016
- [j89]Huili Zhang, Weitian Tong, Yinfeng Xu, Guohui Lin:
The Steiner traveling salesman problem with online advanced edge blockages. Comput. Oper. Res. 70: 26-38 (2016) - [j88]Jianming Dong, Xueshi Wang, Jueliang Hu, Guohui Lin:
An improved two-machine flowshop scheduling with intermediate transportation. J. Comb. Optim. 31(3): 1316-1334 (2016) - [j87]Jianming Dong, Jueliang Hu, Guohui Lin:
A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines. Optim. Lett. 10(1): 109-118 (2016) - [j86]Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong, Randy Goebel, Yinfeng Xu, Guohui Lin:
Machine scheduling with a maintenance interval and job delivery coordination. Optim. Lett. 10(8): 1645-1656 (2016) - [j85]Weitian Tong, Randy Goebel, Guohui Lin:
Smoothed heights of tries and patricia tries. Theor. Comput. Sci. 609: 620-626 (2016) - [c60]Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin:
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan. FAW 2016: 227-237 - [c59]Wenchang Luo, Yao Xu, Weitian Tong, Guohui Lin:
Single Machine Scheduling with Job-Dependent Machine Deterioration. ISAAC 2016: 55:1-55:13 - [i5]Yao Xu, Randy Goebel, Guohui Lin:
Submodular and supermodular multi-labeling, and vertex happiness. CoRR abs/1606.03185 (2016) - [i4]Wenchang Luo, Yao Xu, Weitian Tong, Guohui Lin:
Single machine scheduling with job-dependent machine deterioration. CoRR abs/1606.04157 (2016) - [i3]Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen:
Approximation algorithms for the maximum weight internal spanning tree problem. CoRR abs/1608.03299 (2016) - 2015
- [j84]Yining Wang, Tim Wylie, Paul Stothard, Guohui Lin:
Whole genome SNP genotype piecemeal imputation. BMC Bioinform. 16: 340:1-340:11 (2015) - [j83]Haitao Jiang, Guohui Lin, Weitian Tong, Daming Zhu, Binhai Zhu:
Isomorphism and similarity for 2-generation pedigrees. BMC Bioinform. 16(S-5): S7 (2015) - [j82]Huili Zhang, Weitian Tong, Yinfeng Xu, Guohui Lin:
The Steiner Traveling Salesman Problem with online edge blockages. Eur. J. Oper. Res. 243(1): 30-40 (2015) - [j81]Liqin Huang, Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin:
A 0.5358-approximation for Bandpass-2. J. Comb. Optim. 30(3): 612-626 (2015) - [j80]Francis Y. L. Chin, Bin Fu, Jiuling Guo, Shuguang Han, Jueliang Hu, Minghui Jiang, Guohui Lin, Hing-Fung Ting, Luping Zhang, Yong Zhang, Diwei Zhou:
Competitive algorithms for unbounded one-way trading. Theor. Comput. Sci. 607: 35-48 (2015) - [j79]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu:
Improved parameterized and exact algorithms for cut problems on trees. Theor. Comput. Sci. 607: 455-470 (2015) - [c58]Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong, Randy Goebel, Yinfeng Xu, Guohui Lin:
Machine Scheduling with a Maintenance Interval and Job Delivery Coordination. FAW 2015: 104-114 - 2014
- [j78]Guohui Lin:
Preface. J. Comb. Optim. 27(1): 1-2 (2014) - [j77]Zhixiang Chen, Bin Fu, Randy Goebel, Guohui Lin, Weitian Tong, Jinhui Xu, Boting Yang, Zhiyu Zhao, Binhai Zhu:
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions. Theor. Comput. Sci. 550: 59-65 (2014) - [j76]Weitian Tong, Randy Goebel, Guohui Lin:
Approximating the minimum independent dominating set in perturbed graphs. Theor. Comput. Sci. 554: 275-282 (2014) - [j75]Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin:
Approximating the maximum multiple RNA interaction problem. Theor. Comput. Sci. 556: 63-70 (2014) - [c57]Wei Ding, Guohui Lin:
Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights. AAIM 2014: 197-207 - [c56]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu:
Algorithms for Cut Problems on Trees. COCOA 2014: 283-298 - [c55]Weitian Tong, Randy Goebel, Guohui Lin:
On the Smoothed Heights of Trie and Patricia Index Trees. COCOON 2014: 94-103 - [c54]Weitian Tong, Guohui Lin:
An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem. ISAAC 2014: 353-364 - [c53]Min Lu, Tian Liu, Weitian Tong, Guohui Lin, Ke Xu:
Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems. TAMC 2014: 248-258 - 2013
- [j74]Hadi Sabaa, Zhipeng Cai, Yining Wang, Randy Goebel, Stephen Moore, Guohui Lin:
Whole genome Identity-by-Descent determination. J. Bioinform. Comput. Biol. 11(2) (2013) - [j73]Guangting Chen, Guohui Lin, Zhiyi Tan:
Preface. J. Comb. Optim. 26(3): 415 (2013) - [j72]Guohui Lin:
Preface. Theor. Comput. Sci. 507: 1 (2013) - [c52]Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin:
Approximation Algorithms for the Maximum Multiple RNA Interaction Problem. COCOA 2013: 49-59 - [c51]Weitian Tong, Randy Goebel, Guohui Lin:
Approximating the Minimum Independent Dominating Set in Perturbed Graphs. COCOON 2013: 257-267 - [c50]Yi Shi, Xinhua Zhang, Xiaoping Liao, Guohui Lin, Dale Schuurmans:
Protein-chemical Interaction Prediction via Kernelized Sparse Learning SVM. Pacific Symposium on Biocomputing 2013: 41-52 - [i2]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu:
Algorithms for Cut Problems on Trees. CoRR abs/1304.3653 (2013) - [i1]Weitian Tong, Zhi-Zhong Chen, Lusheng Wang, Yinfeng Xu, Jiuping Xu, Randy Goebel, Guohui Lin:
An approximation algorithm for the Bandpass-2 problem. CoRR abs/1307.7089 (2013) - 2012
- [j71]Yi Shi, Maryam Hasan, Zhipeng Cai, Guohui Lin, Dale Schuurmans:
Linear Coherent Bi-Clustering via Beam Searching and Sample Set Clustering. Discret. Math. Algorithms Appl. 4(2) (2012) - [j70]Yongxi Cheng, Guohui Lin:
Solving haplotype inference problem with non-genotyped founders via integer linear programming. J. Comb. Optim. 23(1): 50-60 (2012) - [j69]Haitao Jiang, Zhong Li, Guohui Lin, Lusheng Wang, Binhai Zhu:
Exact and approximation algorithms for the complementary maximal strip recovery problem. J. Comb. Optim. 23(4): 493-506 (2012) - [j68]Guohui Lin, Randy Goebel, Zhong Li, Lusheng Wang:
An improved approximation algorithm for the complementary maximal strip recovery problem. J. Comput. Syst. Sci. 78(3): 720-730 (2012) - [c49]Weitian Tong, Randy Goebel, Wei Ding, Guohui Lin:
An Improved Approximation Algorithm for the Bandpass Problem. FAW-AAIM 2012: 351-358 - [c48]Yi Shi, Xiaoping Liao, Xinhua Zhang, Guohui Lin, Dale Schuurmans:
Sparse Learning Based Linear Coherent Bi-clustering. WABI 2012: 346-364 - [e2]Guohui Lin:
Combinatorial Optimization and Applications - 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings. Lecture Notes in Computer Science 7402, Springer 2012, ISBN 978-3-642-31769-9 [contents] - 2011
- [j67]Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
An Approximation Algorithm for the Minimum Co-Path Set Problem. Algorithmica 60(4): 969-986 (2011) - [j66]Wei Ding, Guohui Lin, Guoliang Xue:
Diameter-Constrained Steiner Trees. Discret. Math. Algorithms Appl. 3(4): 491-502 (2011) - [j65]Guohui Lin:
On the Bandpass problem. J. Comb. Optim. 22(1): 71-77 (2011) - [j64]