Computing Maximum Valued Regions

  G. J. Woeginger

Abstract:

  We consider the problem of finding optimum connected configurations in the plane and in undirected graphs. First, we show that a special case concerning rectilinear grids in the plane and arising in oil business is NP-complete, and we present a fast approximation algorithm for it. Secondly, we identify a number of polynomial time solvable special cases for the corresponding problem in graphs. The special cases include trees, interval graphs, cographs and split graphs.

 Gyenizse Pal 1996. Szeptember 4. Szerda 13:45:39 MET DST