FPTAS’s for Some Cut Problems in Weighted Trees

DOI10.1007/978-3-642-14553-7_21zbMath1288.68280OpenAlexW1499833276MaRDI QIDQ3587352

Mingyu Xiao, Hiroshi Nagamochi, Takuro Fukunaga

Publication date: 7 September 2010

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14553-7_21

zbMATH Keywords

FPTASgraph cuttree knapsack

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

This page was built for publication: FPTAS’s for Some Cut Problems in Weighted Trees