scientific article; zbMATH DE number 1163704
From MaRDI portal
Publication:4395317
zbMath0911.90333MaRDI QIDQ4395317
No author found.
Publication date: 5 May 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (7)
On the efficiency of polynomial time approximation schemes ⋮ On the minimum corridor connection problem and other generalized geometric problems ⋮ Performance guarantees for the TSP with a parameterized triangle inequality ⋮ Faster geometric \(k\)-point MST approximation ⋮ Confronting intractability via parameters ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Approximation algorithms for lawn mowing and milling
Uses Software
This page was built for publication:
