scientific article; zbMATH DE number 6297772
From MaRDI portal
Publication:5417693
zbMath1288.68274MaRDI QIDQ5417693
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (5)
Dynamic vs. oblivious routing in network design ⋮ A note on hierarchical hubbing for a generalization of the VPN problem ⋮ Stochastic Control Liaisons: Richard Sinkhorn Meets Gaspard Monge on a Schrödinger Bridge ⋮ Exploring the Tractability of the Capped Hose Model ⋮ Virtual private network design over the first Chvátal closure
This page was built for publication:
