Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

COCOON
2009
Springer

favoriteEmaildiscussreport

140views Combinatorics» more COCOON 2009»

Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem

13 years 10 months ago

Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem

Download tcslab.csce.kyushu-u.ac.jp

Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi

Real-time Traffic

COCOON 2009 | Combinatorics |

claim paper

Related Content

» Computing the minimum number of hybridization events for a consistent evolutionary history

» The traveling salesman problem with pickup and delivery polyhedral results and a branchand...

» The Largest Compatible Subset Problem for Phylogenetic Data

» Dynamic entity distribution in parallel discrete event simulation

» Dynamic multiagent probabilistic inference

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	COCOON
Authors	Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada

Comments (0)