A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
type: Item
instance of: scholarly article
title: A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
zbMATH Open document ID: 1044.90061
author: Sung-Pil Hong
author: Sung-Jin Chung
author: Bum Hwan Park
published in: Operations Research Letters
publication date: 2004-03-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2057195
zbMATH Keywords: Spanning tree
zbMATH Keywords: Bicriteria approximation
zbMATH Keywords: Fully polynomial approximation scheme
zbMATH Keywords: Matrix-tree theorem
MaRDI profile type: Publication
full work available at URL: j.orl.2003.06.003
OpenAlex ID: W2024840331
cites work: Exact arborescences, matchings and cycles
cites work: Approximation algorithms for multi-parameter graph optimization problems
cites work: Q5284651
cites work: Counting Minimum Weight Spanning Trees
cites work: A Combinatorial Proof of the All Minors Matrix Tree Theorem
cites work: Matrix tree theorems
cites work: Approximation Schemes for the Restricted Shortest Path Problem
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: A simple efficient approximation scheme for the restricted shortest path problem
cites work: Determinant: Old Algorithms, New Insights
cites work: Bicriteria Network Design Problems
cites work: The constrained minimum spanning tree problem
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Q5786986
cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
DOI: 10.1016/J.ORL.2003.06.003
description: scientific article; zbMATH DE number 2057195