Approximating the Minimum Spanning Tree Weight in Sublinear Time

SIAM Journal on Computing - United States
doi 10.1137/s0097539702403244
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Generalized Minimum Spanning Tree Games

EURO Journal on Computational Optimization
ControlSimulationManagement ScienceOptimizationModelingComputational MathematicsOperations Research
2015English

Domination on Minimum Diameter Spanning Tree

International Journal of Research in Advent Technology
2019English

Uncertain Quadratic Minimum Spanning Tree Problem

Journal of Communications
Electronic EngineeringElectrical
2014English

Heuristic Search for the Generalized Minimum Spanning Tree Problem

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2005English

Approximating Maximum Leaf Spanning Trees in Almost Linear Time

Journal of Algorithms
1998English

Offline Algorithms for Dynamic Minimum Spanning Tree Problems

Journal of Algorithms
1994English

Parallel Minimum Spanning Tree Heuristic for the Steiner Problem in Graphs

2007English

Automatically Produced Algorithms for the Generalized Minimum Spanning Tree Problem

Scientific Programming
Computer Science ApplicationsSoftware
2016English

An Asymptotic Determination of the Minimum Spanning Tree and Minimum Matching Constants in Geometrical Probability

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
1990English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy