, Volume 14, Issue 2, pp 217–241 | Cite as

Call routing and the ratcatcher

  • P. D. Seymour
  • R. Thomas


Suppose we expect there to bep(ab) phone calls between locationsa andb, all choices ofa, b from some setL of locations. We wish to design a network to optimally handle these calls. More precisely, a “routing tree” is a treeT with set of leavesL, in which every other vertex has valency 3. It has “congestion” <k if for every edgee ofT, there are fewer thank calls which will be routed alonge, that is, between locationa, b in different components ofT/e. Deciding if there is a routing tree with congestion <k is NP-hard, but if the pairsab, withp(ab)>0 form the edges of a planar graphG, there is an efficient, strongly polynomial algorithm.

This is because the problem is equivalent to deciding if a ratcatcher can corner a rat loose in the walls of a house with floor planG, wherep(ab) is a thickness of the wallab. The ratcatcher carries a noisemaker of powerk, and the rat will not move through any wall in which the noise level is too high (determined by the total thickness of the intervening walls between this one and the noisemaker).

It follows that branch-width is polynomially computable for planar graphs—that too is NP-hard for general graphs.

AMS subject classification code (1991)

05 C 78 05 C 85 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D. Bienstock, N. Robertson, P. D. Seymour andR. Thomas: Quickly excluding a forest,J. Combinatorial Theory, Ser. B,52 (1991), 274–283.Google Scholar
  2. [2]
    G. N. Frederickson: Fast algorithms for shortest paths in planar graphs, with applications,SIAM J. Comput. 16 (1987), 1004–1022.Google Scholar
  3. [3]
    M. R. Garey, D. S. Johnson andL. Stockmeyer: Some simplified NP-complete problems,Theor. Comput. Sci. 1 (1976), 237–267.Google Scholar
  4. [4]
    N. Robertson andP. D. Seymour: Graph minors. X. Obstructions to treedecomposition,J. Combinatorial Theory, Ser B 59 (1991), 153–190.Google Scholar
  5. [5]
    N. Robertson andP. D. Seymour: Graph minors. XI. Circuits on a surface,J. Combinatorial Theory, Ser. B 60 (1994), 72–106.Google Scholar
  6. [6]
    M. Yannakakis: A polynomial algorithm for the min cut linear arrangement of trees,J. Assoc. Comp. Mach. 32 (1985), 950–988.Google Scholar

Copyright information

© Akadémiai Kiadó 1994

Authors and Affiliations

  • P. D. Seymour
    • 1
  • R. Thomas
    • 2
  1. 1.BellcoreMorristownUSA
  2. 2.School of MathematicsGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations