The 2-hop spanning tree problem
type: Item
instance of: scholarly article
title: The 2-hop spanning tree problem
zbMATH Open document ID: 0957.90093
DOI: 10.1016/S0167-6377(98)00029-7
author: Geir Dahl
published in: Operations Research Letters
publication date: 1999-10-04T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1347295
zbMATH Keywords: integer programming
zbMATH Keywords: hop-constrained spanning tree
zbMATH Keywords: polyhedra
MaRDI profile type: Publication
cites work: Q3341651
cites work: Stable Set Polytopes for a Class of Circulant Graphs
cites work: Q4845371
cites work: Q4040221
Recommended article: The two-level diameter constrained spanning tree problem
Recommended article: On spanning 2-trees in a graph
Recommended article: Two dependency constrained spanning tree problems
Recommended article: The hybrid spanning tree problem
Recommended article: Q4761320
Recommended article: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Recommended article: The 2-path network problem
Recommended article: On the SPANNING \(k\)-TREE problem
Recommended article: Q4252380
Recommended article: Q4945509
description: scientific article; zbMATH DE number 1347295