Author image not provided
 Qianping Gu

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article4.68
Citation Count220
Publication count47
Publication years1994-2016
Available for download2
Average downloads per article204.00
Downloads (cumulative)408
Downloads (12 Months)17
Downloads (6 Weeks)2
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


47 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 47
Result page: 1 2 3

Sort by:

1
December 2016 Information Sciences: an International Journal: Volume 374 Issue C, December 2016
Publisher: Elsevier Science Inc.
Bibliometrics:
Citation Count: 0

The Steiner travelling salesman problem (STSP) is an important issue in intelligent transportation systems and has various practical applications, such as travelling and parcel delivery. In this study, we consider the STSP in real-world road maps, i.e., given a road map with a set of service points or intersections, selection ...
Keywords: Branch decomposition, Intelligent transportation system, Vehicle routing, Sphere-cut decomposition, Steiner travelling salesman problem

2
July 2016 Journal of Combinatorial Optimization: Volume 32 Issue 1, July 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The connected dominating set (CDS) problem is a well studied NP-hard problem with many important applications. Dorn et al. (Algorithmica 58:790---810 2010) introduce a branch-decomposition based algorithm design technique for NP-hard problems in planar graphs and give an algorithm (DPBF algorithm) which solves the planar CDS problem in $$O(2^{9.822\sqrt{n}}n+n^3)$$O(29.822nn+n3) time ...
Keywords: Fixed-parameter algorithms, Planar graphs, Branch-decomposition based algorithms, Connected dominating set, Computational study

3
January 2016 Discrete Applied Mathematics: Volume 199 Issue C, January 2016
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

Branch-decompositions of graphs have important algorithmic applications. A graph G of small branchwidth admits efficient algorithms for many NP-hard problems in G . These algorithms usually run in exponential time in the branchwidth and polynomial time in the size of G . It is critical to compute the branchwidth and ...
Keywords: Branch-decomposition, Computational study, Planar graphs, Graph algorithms

4
November 2015 Theoretical Computer Science: Volume 607 Issue P1, November 2015
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0


5
November 2012 Algorithmica: Volume 64 Issue 3, November 2012
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

For graph G, let źbw(G) denote the branchwidth of G and źgm(G) the largest integer g such that G contains a g�g grid as a minor. We show that źbw(G)≤3źgm(G) for every planar graph G. This is an improvement over the bound źbw(G)≤4źgm(G) due to Robertson, Seymour and Thomas. Our ...
Keywords: Branch-decomposition, Graph, Graph minor, Hypergraph, Planar graph, Branchwidth, Grid

6
December 2011 ISAAC'11: Proceedings of the 22nd international conference on Algorithms and Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Bidimensionality theory provides a general framework for developing subexponential fixed parameter algorithms for NP-hard problems. In this framework, to solve an optimization problem in a graph <em>G</em>, the branchwidth <InlineEquation ID="IEq1"><InlineMediaObject><ImageObject FileRef="978-3-642-25591-5_38_Chapter_TeX2GIF_IEq1.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"/></InlineMediaObject><EquationSource Format="TEX">${\mathop{\rm bw}}(G)$</EquationSource></InlineEquation> is first computed or estimated. If <InlineEquation ID="IEq2"><InlineMediaObject><ImageObject FileRef="978-3-642-25591-5_38_Chapter_TeX2GIF_IEq2.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" ...
Keywords: bidimensional algorithms, experimental algorithms, grid minor, longest path problem, branchdecomposition

7
July 2011 Theoretical Computer Science: Volume 412 Issue 32, July, 2011
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 4

We give constant-factor approximation algorithms for computing the optimal branch-decompositions and largest grid minors of planar graphs. For a planar graph G with n vertices, let bw(G) be the branchwidth of G and gm(G) the largest integer g such that G has a gxg grid as a minor. Let c>=1 ...
Keywords: Branch-decompositions, Graph algorithms, Graph minors

8
December 2010 COCOA'10: Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

The connected dominating set (CDS) problem is a well studied NP-hard problem with many important applications. Dorn et al. [ESA2005, LNCS3669, pp95-106] introduce a new technique to generate 2 O (√ n ) time and fixed-parameter algorithms for a number of nonlocal hard problems, including the CDS problem in planar ...
Keywords: computational study, CDS problem, branch-decomposition based algorithms, fixed-parameter algorithms, planar graphs

9
August 2010 Networks: Volume 56 Issue 1, August 2010
Publisher: Wiley-Interscience
Bibliometrics:
Citation Count: 2

We consider the wavelength assignment problem in WDM optical networks with multiple parallel fibers: Given a set P of paths, assign a color to each path such that the number of paths with the same color containing any link is at most the number of fibers in the link. Assuming ...
Keywords: approximation algorithms, path multicoloring, routing and wavelength assignment, call control, star networks

10
April 2010 LATIN'10: Proceedings of the 9th Latin American conference on Theoretical Informatics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 9

We prove a small linear-size kernel for the connected dominating set problem in planar graphs through data reduction. Our set of rules efficiently reduce a planar graph G with n vertices and connected dominating number γ c ( G ) to a kernel of size at most 413 γ c ...

11
December 2009 ISAAC '09: Proceedings of the 20th International Symposium on Algorithms and Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 7

We give constant-factor approximation algorithms for computing the optimal branch-decompositions and largest grid minors of planar graphs. For a planar graph G with n vertices, let ${\mathop{\rm bw}}(G)$ be the branchwidth of G and ${\mathop{\rm gm}}(G)$ the largest integer g such that G has a g � g grid as ...
Keywords: Graph algorithms, branch-decompositions, graph minors

12
December 2009 Theoretical Computer Science: Volume 410 Issue 52, December, 2009
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 4

Recently, there has been significant theoretical progress towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the problem on a planar graph with n vertices and dominating number k can be solved in O(2^O^(^k^)n) time using tree/branch-decomposition based algorithms. In this paper, we report ...
Keywords: PLANAR DOMINATING SET, Branch-decomposition, Computational study, Data reduction, Fixed-parameter algorithms

13
May 2009 Networks: Volume 53 Issue 3, May 2009
Publisher: Wiley-Interscience
Bibliometrics:
Citation Count: 0

In SONET-WDM optical networks, a high-speed wavelength channel is usually shared by multiplexed low-rate network traffic demands. The multiplexing is known as traffic grooming and carried out by SONET Add-Drop Multiplexers (SADM). The maximum number of low-rate traffic demands that can be multiplexed into one wavelength is called the grooming ...
Keywords: approximation algorithm, traffic grooming, SONET-WDM network, graph partitioning

14
March 2009 Discrete Applied Mathematics: Volume 157 Issue 5, March, 2009
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths with the same wavelength are edge-disjoint, using the minimum number of wavelengths. The WA problem is NP-hard for a tree of ...
Keywords: Path coloring, Wavelength assignment, Trees of rings, Communication networks, Approximation algorithms

15
March 2009 Information Processing Letters: Volume 109 Issue 8, March, 2009
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

We give a 1.5-approximation algorithm for the weighted maximum routing and wavelength assignment problem on undirected ring networks. This improves the previous 1.58-approximation result.
Keywords: Approximation algorithms, Ring networks, Routing and path coloring

16
August 2008 COCOA 2008: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

Recently, there has been significant theoretical progress towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the problem on a planar graph with <em>n</em>vertices and dominating number <em>k</em>can be solved in $O(c^{\sqrt{k}}n)$ time using tree/branch-decomposition based algorithms, where <em>c</em>is some constant. However there has ...
Keywords: branch-decomposition, fixed-parameter algorithms, data reduction, PLANAR DOMINATING SET, computational study

17 published by ACM
July 2008 ACM Transactions on Algorithms (TALG): Volume 4 Issue 3, June 2008
Publisher: ACM
Bibliometrics:
Citation Count: 19
Downloads (6 Weeks): 2,   Downloads (12 Months): 17,   Downloads (Overall): 407

Full text available: PDFPDF
We give an O ( n 3 ) time algorithm for constructing a minimum-width branch-decomposition of a given planar graph with n vertices. This is achieved through a refinement to the previously best known algorithm of Seymour and Thomas, which runs in O ( n 4 ) time.
Keywords: planar graphs, Branch-decompositions

18
June 2008 Journal of Parallel and Distributed Computing: Volume 68 Issue 6, June, 2008
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 3

In SONET/WDM networks, a high-speed wavelength channel is usually shared by multiple low-rate traffic demands to make efficient use of the wavelength capacity. The multiplexing is known as traffic grooming and performed by SONET Add-Drop Multiplexers (SADM). The maximum number of low-rate traffic demands that can be multiplexed into one ...
Keywords: Graph partition, SONET/WDM networks, Traffic grooming, Approximation algorithm, NP-completeness

19
May 2008 WEA'08: Proceedings of the 7th international conference on Experimental algorithms
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 6

A graph of small branchwidth admits efficient dynamic programming algorithms for many NP-hard problems on the graph. A key step in these algorithms is to find a branch decomposition of small width for the graph. Given a planar graph G of n vertices, an optimal branch decomposition of G can ...
Keywords: branch-decomposition, graph algorithms, planar graphs, algorithm engineering, computational study

20
January 2008 Proceedings of the Meeting on Algorithm Engineering & Expermiments
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 1

Full text available: PDFPDF
We propose efficient implementations of Seymour and Thomas algorithm which, given a planar graph and an integer β, decides whether the graph has the branchwidth at least β. The computational results of our implementations show that the branchwidth of a planar graph can be computed in a practical time and ...
Keywords: computational study, branch-decomposition, graph algorithms, planar graphs, algorithm engineering



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us