Applications of efficient mergeable heaps for optimization problems on trees

DOI10.1007/BF00288535zbMath0431.68062OpenAlexW2020160071MaRDI QIDQ1138378

Zvi Galil

Publication date: 1980

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00288535

zbMATH Keywords

efficient mergeable heapsoptimization problems on trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Operations research games: A survey. (With comments and rejoinder) ⋮ The nucleolus of trees with revenues ⋮ The kernel/nucleolus of a standard tree game ⋮ The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties

Cites Work

• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• Unnamed Item

This page was built for publication: Applications of efficient mergeable heaps for optimization problems on trees