scientific article
From MaRDI portal
Publication:3129922
zbMath0873.68169MaRDI QIDQ3129922
Giora Slutzki, David Eppstein, David Fernández Baca
Publication date: 28 May 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (13)
An FPTAS for the parametric knapsack problem ⋮ A stronger lower bound on parametric minimum spanning trees ⋮ The Parametric Closure Problem ⋮ An approximation algorithm for a general class of parametric optimization problems ⋮ A general approximation method for bicriteria minimization problems ⋮ Upgrading min-max spanning tree problem under various cost functions ⋮ Decomposable multi-parameter matroid optimization problems. ⋮ Possibilistic bottleneck combinatorial optimization problems with ill-known weights ⋮ A stronger lower bound on parametric minimum spanning trees ⋮ Approximation schemes for the parametric knapsack problem ⋮ An FPTAS for the knapsack problem with parametric weights ⋮ Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights ⋮ An approximation algorithm for a general class of multi-parametric optimization problems
This page was built for publication:
