scientific article; zbMATH DE number 7205024
From MaRDI portal
Publication:5111735
DOI10.4230/LIPIcs.ESA.2017.46zbMath1442.68175arXiv1707.01487MaRDI QIDQ5111735
Guru Prashanth Guruganesh, R. Ravi, Jennifer Iglesias, Laura Sanità
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1707.01487
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Approximation algorithms (68W25) Signed and weighted graphs (05C22) Flows in graphs (05C21)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Dynamic vs. oblivious routing in network design
- Routing of uncertain traffic demands
- A factor 2 approximation algorithm for the generalized Steiner network problem
- An improved approximation algorithm for requirement cut
- Network design with a discrete set of traffic matrices
- Combinatorial auctions with decreasing marginal utilities
- From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems
- Designing Least-Cost Nonblocking Broadband Networks
- Fast Approximation Algorithms for the Generalized Survivable Network Design Problem
- A General Approximation Technique for Constrained Forest Problems
- Provisioning a virtual private network
- On Maximizing Welfare When Utility Functions Are Subadditive
- The VPN Conjecture Is True
- Node-and edge-deletion NP-complete problems
- A tight bound on approximating arbitrary metrics by tree metrics
This page was built for publication:
