Minimum cost partitions of trees with supply and demand
type: Item
instance of: scholarly article
title: Minimum cost partitions of trees with supply and demand
zbMATH Open document ID: 1255.68073
author: Takehiro Ito
author: Takuya Hara
author: Xiao Zhou
author: Takao Nishizeki
published in: Algorithmica
publication date: 2013-01-28T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6131858
zbMATH Keywords: approximation algorithm
zbMATH Keywords: demand vertex
zbMATH Keywords: directed edge
zbMATH Keywords: FPTAS
zbMATH Keywords: graph partition
zbMATH Keywords: supply vertex
zbMATH Keywords: tree
MaRDI profile type: Publication
full work available at URL: s00453-011-9573-7
OpenAlex ID: W2090058386
cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
cites work: Q4198056
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Approximability of partitioning graphs with supply and demand
cites work: Minimum Cost Partitions of Trees with Supply and Demand
cites work: PARTITIONING TREES OF SUPPLY AND DEMAND
cites work: Partitioning graphs of supply and demand
cites work: Parameterized Approximation Scheme for the Multiple Knapsack Problem
cites work: Q4298260
DOI: 10.1007/S00453-011-9573-7
description: scientific article; zbMATH DE number 6131858