Modifying networks to obtain low cost trees
DOI10.1007/3-540-62559-3_24zbMATH Open1539.68229MaRDI QIDQ6550552FDOQ6550552
Authors: Sven O. Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister 
Publication date: 5 June 2024
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation Schemes for the Restricted Shortest Path Problem
- Bicriteria Network Design Problems
- Title not available (Why is that?)
- A General Approximation Technique for Constrained Forest Problems
- Routing to Multiple Destinations in Computer Networks
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Title not available (Why is that?)
- Many birds with one stone
- Optimal attack and reinforcement of a network
- The complexity of designing a network with minimum diameter
- Improving the location of minisum facilities through network modification
- Title not available (Why is that?)
This page was built for publication: Modifying networks to obtain low cost trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550552)
