The maximum \(f\)-depth spanning tree problem
type: Item
instance of: scholarly article
title: The maximum \(f\)-depth spanning tree problem
zbMATH Open document ID: 1032.68087
DOI: 10.1016/S0020-0190(01)00160-0
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1767166
zbMATH Keywords: Approximate algorithms
zbMATH Keywords: Differential ratio
zbMATH Keywords: Performance ratio
zbMATH Keywords: Analysis of algorithms
zbMATH Keywords: Reductions
author: Jérôme Monnot
MaRDI profile type: Publication
cites work: Approximate solution of NP optimization problems
cites work: Structure preserving reductions among convex optimization problems
cites work: The Steiner problem with edge lengths 1 and 2
cites work: Completeness in approximation classes
cites work: Differential approximation algorithms for some combinatorial optimization problems
cites work: Bridging gap between standard and differential polynomial approximation: The case of bin-packing
cites work: On an approximation measure founded on the links between optimization and polynomial approximation theory
cites work: An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
cites work: Q4198056
cites work: Multicommodity flow models for spanning trees with hop constraints
cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
cites work: Designing reliable tree networks with two cable technologies
cites work: Approximating k-set cover and complementary graph coloring
cites work: Q3140426
cites work: Q5501786
cites work: Bicriteria Network Design Problems
cites work: Q4782716
cites work: The Traveling Salesman Problem with Distances One and Two
full work available at URL: s0020-0190(01)00160-0
OpenAlex ID: W2019955382
Recommended article: On the approximability of some maximum spanning tree problems
Recommended article: On the approximability of some Maximum Spanning Tree Problems
Recommended article: The maximum-leaf spanning tree problem: Formulations and facets
Recommended article: Maximizing spanning trees in almost complete graphs
Recommended article: Q4761320
Recommended article: Q4252380
Recommended article: Maximizing the Number of Spanning Trees in a Connected Graph
Recommended article: Approximating the maximum internal spanning tree problem
Recommended article: On the maximal distance of spanning trees
description: scientific article; zbMATH DE number 1767166