Advertisement

FPTAS’s for Some Cut Problems in Weighted Trees

  • Mingyu Xiao
  • Takuro Fukunaga
  • Hiroshi Nagamochi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6213)

Abstract

Given a tree with nonnegative edge cost and nonnegative vertex weight, and a number k ≥ 0, we consider the following four cut problems: cutting vertices of weight at most or at least k from the tree by deleting some edges such that the remaining part of the graph is still a tree and the total cost of the edges being deleted is minimized or maximized. The MinMstCut problem (cut vertices of weight at most k and minimize the total cost of the edges being deleted) can be solved in linear time and space and the other three problems are NP-hard. In this paper, we design an O(ln/ε)-time O(l 2/ε + n)-space algorithm for MaxMstCut, and O(ln(1/ε + logn))-time O(l 2/ε + n)-space algorithms for MinLstCut and MaxLstCut, where n is the number of vertices in the tree, l the number of leaves, and ε> 0 the prescribed error bound.

Keywords

Graph Cut FPTAS Tree Tree Knapsack 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cho, G., Shaw, D.X.: A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem. INFORMS Journal on Computing 9(4), 431–438 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Ibarra, O., Kim, C.: Approximation algorithms for certain scheduling problems. Math. Oper. Res. 3(3), 197–204 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Johnson, D.S., Niemi, K.A.: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees. Mathematics of Operations Research 8(1), 1–14 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Jordan, C.: Sur Les Assemblages De Lignes. J. Reine Angew. Math. 70, 185–190 (1869)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)CrossRefzbMATHGoogle Scholar
  6. 6.
    Könemann, J., Parekh, O., Segev, D.: A unified approach to approximating partial covering problems. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 468–479. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Sahni, S.: General Techniques for Combinatorial Approximation. Operations Research 25(6), 920–936 (1977)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Xiao, M., Fukunaga, T., Nagamochi, H.: Optimally Cutting a Prescribed Number of Vertices Away From a Tree (manuscript) (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Mingyu Xiao
    • 1
  • Takuro Fukunaga
    • 2
  • Hiroshi Nagamochi
    • 2
  1. 1.School of Computer Science and EngineeringUniversity of Electronic Science and Technology of ChinaChina
  2. 2.Department of Applied Mathematics and Physics, Graduate School of InformaticsKyoto UniversityJapan

Personalised recommendations