Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem
From MaRDI portal
Publication:5323050
DOI10.1007/978-3-642-02882-3_7zbMath1248.68382OpenAlexW1775873331MaRDI QIDQ5323050
Koichi Wada, Hirotaka Ono, Taisuke Izumi, Tomoko Izumi
Publication date: 23 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2324/14761
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
This page was built for publication: Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem