Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

被引：0

作者：

Jochen Könemann

Asaf Levin

Amitabh Sinha

机构：

[1] Department of Combinatorics and Optimization,

[2] University of Waterloo,undefined

[3] 200 University Avenue West,undefined

[4] Waterloo,undefined

[5] Ontario,undefined

[6] N2L 3G1,undefined

[7] Faculty of Industrial Engineering and Management,undefined

[8] The Technion,undefined

[9] Haifa 32000,undefined

[10] Business School,undefined

[11] University of Michigan,undefined

[12] Ann Arbor,undefined

[13] MI 48103,undefined

来源：

Algorithmica | 2005年 / 41卷

关键词：

Approximation algorithms; Spanning trees; Bicriteria approximation; Degree-bounded spanning trees;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We consider the problem of finding a minimum diameter spanning tree with maximum node degree $B$ in a complete undirected edge-weighted graph. We provide an $O(\sqrt{\log_Bn})$-approximation algorithm for the problem. Our algorithm is purely combinatorial, and relies on a combination of filtering and divide and conquer.

引用

页码：117 / 129

页数：12

共 50 条

[41] A polyhedral study of the diameter constrained minimum spanning tree problem
Gouveia, Luis
Leitner, Markus
Ljubic, Ivana
DISCRETE APPLIED MATHEMATICS, 2020, 285 (285) : 364 - 379
[42] A hybrid heuristic for the diameter constrained minimum spanning tree problem
Lucena, Abilio
Ribeiro, Celso C.
Santos, Andrea C.
JOURNAL OF GLOBAL OPTIMIZATION, 2010, 46 (03) : 363 - 381
[43] Minimum bounded degree spanning trees
Goemans, Michel X.
47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2006, : 273 - 282
[44] Fuzzy Degree-Constrained Minimum Spanning Tree problem
Lu, Yiwen
Proceedings of the Fifth International Conference on Information and Management Sciences, 2006, 5 : 578 - 584
[45] Dense Active Appearance Models Using a Bounded Diameter Minimum Spanning Tree
Anderson, Robert
Stenger, Bjorn
Cipolla, Roberto
PROCEEDINGS OF THE BRITISH MACHINE VISION CONFERENCE 2012, 2012,
[46] A new encoding for the degree constrained minimum spanning tree problem
Soak, SM
Corne, D
Ahn, BH
KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 1, PROCEEDINGS, 2004, 3213 : 952 - 958
[47] A Bounded Diameter Minimum Spanning Tree Evolutionary Algorithm Based on Double Chromosome
Gu, Fangqing
Liu, Hai-lin
Liu, Wei
WORLD SUMMIT ON GENETIC AND EVOLUTIONARY COMPUTATION (GEC 09), 2009, : 157 - 162
[48] New Multi-parent Recombination in Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem
Huynh Thi Thanh Binh
Nguyen Duc Nghia
2009 FIRST ASIAN CONFERENCE ON INTELLIGENT INFORMATION AND DATABASE SYSTEMS, 2009, : 283 - 288
[49] Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-) Heuristics
Gruber, Martin
Raidl, Guenther R.
COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2009, 2009, 5717 : 665 - 672
[50] APPROXIMATING THE SPANNING κ-TREE FOREST PROBLEM
Liao, Chung-Shou
Zhang, Louxin
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (07) : 1543 - 1554

← 1 2 3 4 5 →