The 2-hop spanning tree problem

Authors:
Geir Dahl
Affiliations:
University of Oslo, Department of Informatics, P.O. Box 1080, Blindern, 0316 Oslo, Norway11Correspondence address. and Department of Management Science and Statistics, Maryland Business School, Un ...
Venue:
Operations Research Letters
Year:
1998

Citing 1
Cited 5

Integer and combinatorial optimization

Integer and combinatorial optimization

Minimum spanning tree with hop restrictions

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints

Computers and Operations Research
Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem

Journal of Heuristics
The k edge-disjoint 3-hop-constrained paths polytope

Discrete Optimization
Fair solutions for some multiagent optimization problems

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A spanning tree in a graph G where each node has distance at most 2 from a root node r is called a 2-hop spanning tree. For given edge weights the 2-hop spanning tree problem is to find a minimum weight 2-hop spanning tree. The problem is NP-hard. We study the problem from a polyhedral point of view based on a directed formulation and give, for example, a completeness result when G is an n-wheel.