## Abstract

Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can receive "power" from at most one supply vertex through edges in G. One thus wishes to partition G into connected components so that each component C either has no supply vertex or has exactly one supply vertex whose supply is at least the sum of demands in C, and wishes to maximize the fulfillment, that is, the sum of demands in all components with supply vertices. This maximization problem is known to be NP-hard even for trees having exactly one supply vertex and strongly NP-hard for general graphs. In this paper, we focus on the approximability of the problem.We first show that the problem is MAXSNP-hard and hence there is no polynomial-time approximation scheme (PTAS) for general graphs unless P = NP. We then present a fully polynomial-time approximation scheme (FPTAS) for trees. The FPTAS can be extended for series-parallel graphs and partial k-trees, that is, graphs with bounded treewidth, if there is exactly one supply vertex in the graph. This is a joint work with E. Demaine, T. Nishizeki and X. Zhou.

Original language | English |
---|---|

Pages | 162-179 |

Number of pages | 18 |

Publication status | Published - 2014 Jan 1 |

Event | 1st Workshop on Algorithms and Computation 2007, WALCOM 2007 - Dhaka, Bangladesh Duration: 2007 Feb 12 → … |

### Other

Other | 1st Workshop on Algorithms and Computation 2007, WALCOM 2007 |
---|---|

Country/Territory | Bangladesh |

City | Dhaka |

Period | 07/2/12 → … |

## Keywords

- Approximation algorithm
- Demand
- FPTAS
- MAXSNP-hard
- Maximum partition problem
- Supply
- Trees

## ASJC Scopus subject areas

- Computational Theory and Mathematics
- Applied Mathematics
- Computational Mathematics