Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios

doi 10.1137/1.9781611975994.50
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Approximating Bounded-Degree Spanning Trees and Connected Factors With Leaves

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2017English

The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Very Fast Construction of Bounded-Degree Spanning Graphs via the Semi-Random Graph Process

2020English

Local Search for the Minimum Label Spanning Tree Problem With Bounded Color Classes

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2003English

Greedy Heuristics and Evolutionary Algorithms for the Bounded Minimum-Label Spanning Tree Problem

2008English

The Degree and Cost Adjusted Folk Solution for Minimum Cost Spanning Tree Games

Games and Economic Behavior
EconomicsEconometricsFinance
2019English

Mst_clustering: Clustering via Euclidean Minimum Spanning Trees

The Journal of Open Source Software
2016English

Min-Degree Constrained Minimum Spanning Tree Problem: New Formulation via Miller–Tucker–Zemlin Constraints

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2010English

On the Area Requirements of Euclidean Minimum Spanning Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy