A note on the minimum bounded edge-partition of a tree
type: Item
instance of: scholarly article
title: A note on the minimum bounded edge-partition of a tree
zbMATH Open document ID: 1211.05024
author: Shane Dye
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5702610
zbMATH Keywords: tree
zbMATH Keywords: partition
zbMATH Keywords: optimization problem
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: j.dam.2009.04.001
OpenAlex ID: W1987374081
cites work: \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
cites work: A 5/4 linear time bin packing algorithm
cites work: Q3002852
cites work: Scenarios for multistage stochastic programs
cites work: A linear time bin-packing algorithm
cites work: Q3993418
cites work: A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: On the uniform edge-partition of a tree
DOI: 10.1016/J.DAM.2009.04.001
description: scientific article; zbMATH DE number 5702610