Sciweavers

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

10

IMCSIT
2010

favoriteEmaildiscussreport

101views Information Technology» more IMCSIT 2010»

On the Probabilistic min spanning tree problem

12 years 11 months ago

On the Probabilistic min spanning tree problem

Download proceedings2010.imcsit.org

Nicolas Boria, Cécile Murat, Vangelis Th. P

Real-time Traffic

IMCSIT 2010 | Information Technology |

claim paper

Related Content

» Distributed algorithms for lifetime maximization in sensor networks via MinMax spanning su...

» Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem

» Approximating MinMax Regret Versions of Some Polynomial Problems

» On Byzantine Containment Properties of the min1 Protocol

» Symmetric range assignment with disjoint MST constraints

» A Practical Markov Chain Monte Carlo Approach to Decision Problems

» Approximation algorithms and hardness results for labeled connectivity problems

» Embedding metrics into ultrametrics and graphs into spanning trees with constant average d...

» Tree KernelBased Relation Extraction with ContextSensitive Structured Parse Tree Informati...

Post Info
More Details (n/a)

Added	18 May 2011
Updated	18 May 2011
Type	Journal
Year	2010
Where	IMCSIT
Authors	Nicolas Boria, Cécile Murat, Vangelis Th. Paschos

Comments (0)