Applications of efficient mergeable heaps for optimization problems on trees

DOI10.1007/BF00288535MaRDI QIDQ1138378zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1138378)