Search

Your search keyword '"Lin, Guohui"' showing total 774 results
Start Over Author "Lin, Guohui"

Refine your results

more »

more »

more »

more »
774 results on '"Lin, Guohui"'

101. Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems

Author

Lu, Min, Liu, Tian, Tong, Weitian, Lin, Guohui, Xu, Ke, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Kobsa, Alfred, editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Weikum, Gerhard, editor, Gopal, T. V., editor, Agrawal, Manindra, editor, Li, Angsheng, editor, and Cooper, S. Barry, editor

Published
2014
Full Text
View/download PDF

110. Planar graphs are acyclically edge $(Δ+ 5)$-colorable

Author

Shu, Qiaojun and Lin, Guohui

Subjects
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), FOS: Mathematics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO)
Abstract

An edge coloring of a graph $G$ is to color all the edges in the graph such that adjacent edges receive different colors. It is acyclic if each cycle in the graph receives at least three colors. Fiam{č}ik (1978) and Alon, Sudakov and Zaks (2001) conjectured that every simple graph with maximum degree $Δ$ is acyclically edge $(Δ+ 2)$-colorable -- the well-known acyclic edge coloring conjecture (AECC). Despite many major breakthroughs and minor improvements, the conjecture remains open even for planar graphs. In this paper, we prove that planar graphs are acyclically edge $(Δ+ 5)$-colorable. Our proof has two main steps: Using discharging methods, we first show that every non-trivial planar graph must have one of the eight groups of well characterized local structures; and then acyclically edge color the graph using no more than $Δ+ 5$ colors by an induction on the number of edges., Full version with 120 pages

Published
2023
Full Text
View/download PDF

111. Approximating the Minimum Independent Dominating Set in Perturbed Graphs

Author

Tong, Weitian, Goebel, Randy, Lin, Guohui, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Du, Ding-Zhu, editor, and Zhang, Guochuan, editor

Published
2013
Full Text
View/download PDF

112. Approximation Algorithms for the Maximum Multiple RNA Interaction Problem

Author

Tong, Weitian, Goebel, Randy, Liu, Tian, Lin, Guohui, Hutchison, David, Serieseditor, Kanade, Takeo, Serieseditor, Kittler, Josef, Serieseditor, Kleinberg, Jon M., Serieseditor, Mattern, Friedemann, Serieseditor, Mitchell, John C., Serieseditor, Naor, Moni, Serieseditor, Nierstrasz, Oscar, Serieseditor, Pandu Rangan, C., Serieseditor, Steffen, Bernhard, Serieseditor, Sudan, Madhu, Serieseditor, Terzopoulos, Demetri, Serieseditor, Tygar, Doug, Serieseditor, Vardi, Moshe Y., Serieseditor, Weikum, Gerhard, Serieseditor, Widmayer, Peter, editor, Xu, Yinfeng, editor, and Zhu, Binhai, editor

Published
2013
Full Text
View/download PDF

113. Sparse Learning Based Linear Coherent Bi-clustering

Author

Shi, Yi, Liao, Xiaoping, Zhang, Xinhua, Lin, Guohui, Schuurmans, Dale, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Istrail, Sorin, editor, Pevzner, Pavel, editor, Waterman, Michael S., editor, Raphael, Ben, editor, and Tang, Jijun, editor

Published
2012
Full Text
View/download PDF

114. An Improved Approximation Algorithm for the Bandpass Problem

Author

Tong, Weitian, Goebel, Randy, Ding, Wei, Lin, Guohui, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Snoeyink, Jack, editor, Lu, Pinyan, editor, Su, Kaile, editor, and Wang, Lusheng, editor

Published
2012
Full Text
View/download PDF

115. An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem

Author

Li, Zhong, Goebel, Randy, Wang, Lusheng, Lin, Guohui, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Atallah, Mikhail, editor, Li, Xiang-Yang, editor, and Zhu, Binhai, editor

Published
2011
Full Text
View/download PDF

119. Diameter-Constrained Steiner Tree

Author

Ding, Wei, Lin, Guohui, Xue, Guoliang, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Wu, Weili, editor, and Daescu, Ovidiu, editor

Published
2010
Full Text
View/download PDF

120. Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering

Author

Shi, Yi, Hasan, Maryam, Cai, Zhipeng, Lin, Guohui, Schuurmans, Dale, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Wu, Weili, editor, and Daescu, Ovidiu, editor

Published
2010
Full Text
View/download PDF

121. Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive

Author

Wang, Lusheng, Yang, Yong, Lin, Guohui, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Chen, Bo, editor

Published
2010
Full Text
View/download PDF

123. Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting

Author

Shi, Yi, Cai, Zhipeng, Lin, Guohui, Schuurmans, Dale, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Du, Ding-Zhu, editor, Hu, Xiaodong, editor, and Pardalos, Panos M., editor

Published
2009
Full Text
View/download PDF

124. Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem

Author

Cai, Zhipeng, Goebel, Randy, Lin, Guohui, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Du, Ding-Zhu, editor, Hu, Xiaodong, editor, and Pardalos, Panos M., editor

Published
2009
Full Text
View/download PDF

125. Detecting Community Structure by Network Vectorization

Author

Ren, Wei, Yan, Guiying, Lin, Guohui, Du, Caifeng, Han, Xiaofeng, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Hu, Xiaodong, editor, and Wang, Jie, editor

Published
2008
Full Text
View/download PDF

126. An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem

Author

Cai, Zhipeng, Chen, Zhi-Zhong, Lin, Guohui, Wang, Lusheng, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Yang, Boting, editor, Du, Ding-Zhu, editor, and Wang, Cao An, editor

Published
2008
Full Text
View/download PDF

132. 5-th Phylogenetic Root Construction for Strictly Chordal Graphs

Author

Kennedy, William, Lin, Guohui, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Deng, Xiaotie, editor, and Du, Ding-Zhu, editor

Published
2005
Full Text
View/download PDF

133. Application of Smodels in Quartet Based Phylogeny Construction

Author

Wu, Gang, You, Jia-Huai, Lin, Guohui, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Baral, Chitta, editor, Greco, Gianluigi, editor, Leone, Nicola, editor, and Terracina, Giorgio, editor

Published
2005
Full Text
View/download PDF

134. A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem

Author

Wu, Gang, You, Jia-Huai, Lin, Guohui, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Istrail, Sorin, editor, Pevzner, Pavel, editor, Waterman, Michael, editor, Casadio, Rita, editor, and Myers, Gene, editor

Published
2005
Full Text
View/download PDF

140. Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants

Author

Asahiro, Yuichi, Jansson, Jesper, Lin, Guohui, Miyano, Eiji, Ono, Hirotaka, Utashima, Tadatoshi, Asahiro, Yuichi, Jansson, Jesper, Lin, Guohui, Miyano, Eiji, Ono, Hirotaka, and Utashima, Tadatoshi

Abstract

The problem of computing the longest common subsequence of two sequences (LCS for short) is a classical and fundamental problem in computer science. In this paper, we study four variants of LCS: the Repetition-Bounded Longest Common Subsequence problem (RBLCS) [Yuichi Asahiro et al., 2020], the Multiset-Restricted Common Subsequence problem (MRCS) [Radu Stefan Mincu and Alexandru Popa, 2018], the Two-Side-Filled Longest Common Subsequence problem (2FLCS), and the One-Side-Filled Longest Common Subsequence problem (1FLCS) [Mauro Castelli et al., 2017; Mauro Castelli et al., 2019]. Although the original LCS can be solved in polynomial time, all these four variants are known to be NP-hard. Recently, an exact, O(1.44225?)-time, dynamic programming (DP)-based algorithm for RBLCS was proposed [Yuichi Asahiro et al., 2020], where the two input sequences have lengths n and poly(n). We first establish that each of MRCS, 1FLCS, and 2FLCS is polynomially equivalent to RBLCS. Then, we design a refined DP-based algorithm for RBLCS that runs in O(1.41422?) time, which implies that MRCS, 1FLCS, and 2FLCS can also be solved in O(1.41422?) time. Finally, we give a polynomial-time 2-approximation algorithm for 2FLCS.

Published
2022
Full Text
View/download PDF

141. Approximation Algorithms for Covering Vertices by Long Paths

Author

Mingyang Gong and Jing Fan and Guohui Lin and Eiji Miyano, Gong, Mingyang, Fan, Jing, Lin, Guohui, Miyano, Eiji, Mingyang Gong and Jing Fan and Guohui Lin and Eiji Miyano, Gong, Mingyang, Fan, Jing, Lin, Guohui, and Miyano, Eiji

Abstract

Given a graph, the general problem to cover the maximum number of vertices by a collection of vertex-disjoint long paths seemingly escapes from the literature. A path containing at least k vertices is considered long. When k ≤ 3, the problem is polynomial time solvable; when k is the total number of vertices, the problem reduces to the Hamiltonian path problem, which is NP-complete. For a fixed k ≥ 4, the problem is NP-hard and the best known approximation algorithm for the weighted set packing problem implies a k-approximation algorithm. To the best of our knowledge, there is no approximation algorithm directly designed for the general problem; when k = 4, the problem admits a 4-approximation algorithm which was presented recently. We propose the first (0.4394 k + O(1))-approximation algorithm for the general problem and an improved 2-approximation algorithm when k = 4. Both algorithms are based on local improvement, and their performance analyses are done via amortization.

Published
2022
Full Text
View/download PDF

142. Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants

Author

Yuichi Asahiro and Jesper Jansson and Guohui Lin and Eiji Miyano and Hirotaka Ono and Tadatoshi Utashima, Asahiro, Yuichi, Jansson, Jesper, Lin, Guohui, Miyano, Eiji, Ono, Hirotaka, Utashima, Tadatoshi, Yuichi Asahiro and Jesper Jansson and Guohui Lin and Eiji Miyano and Hirotaka Ono and Tadatoshi Utashima, Asahiro, Yuichi, Jansson, Jesper, Lin, Guohui, Miyano, Eiji, Ono, Hirotaka, and Utashima, Tadatoshi

Abstract

The problem of computing the longest common subsequence of two sequences (LCS for short) is a classical and fundamental problem in computer science. In this paper, we study four variants of LCS: the Repetition-Bounded Longest Common Subsequence problem (RBLCS) [Yuichi Asahiro et al., 2020], the Multiset-Restricted Common Subsequence problem (MRCS) [Radu Stefan Mincu and Alexandru Popa, 2018], the Two-Side-Filled Longest Common Subsequence problem (2FLCS), and the One-Side-Filled Longest Common Subsequence problem (1FLCS) [Mauro Castelli et al., 2017; Mauro Castelli et al., 2019]. Although the original LCS can be solved in polynomial time, all these four variants are known to be NP-hard. Recently, an exact, O(1.44225ⁿ)-time, dynamic programming (DP)-based algorithm for RBLCS was proposed [Yuichi Asahiro et al., 2020], where the two input sequences have lengths n and poly(n). We first establish that each of MRCS, 1FLCS, and 2FLCS is polynomially equivalent to RBLCS. Then, we design a refined DP-based algorithm for RBLCS that runs in O(1.41422ⁿ) time, which implies that MRCS, 1FLCS, and 2FLCS can also be solved in O(1.41422ⁿ) time. Finally, we give a polynomial-time 2-approximation algorithm for 2FLCS.

Published
2022
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results