Modifying edges of a network to obtain short subgraphs
From MaRDI portal
Recommendations
Cites work
- An 11/6-approximation algorithm for the network Steiner problem
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation Schemes for the Restricted Shortest Path Problem
- Biconnectivity approximations and graph carvings
- Edge Weight Reduction Problems in Directed Acyclic Graphs
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256748 (Why is no real title available?)
- scientific article; zbMATH DE number 1256763 (Why is no real title available?)
- scientific article; zbMATH DE number 1263177 (Why is no real title available?)
- scientific article; zbMATH DE number 742977 (Why is no real title available?)
- Improving Minimum Cost Spanning Trees by Upgrading Nodes
- Improving the location of minisum facilities through network modification
- Increasing the Weight of Minimum Spanning Trees
- Linear-time computation of optimal subgraphs of decomposable graphs
- Many birds with one stone
- Parallel Merge Sort
- The constrained minimum spanning tree problem
Cited in
(26)- Up- and downgrading the 1-center in a network
- Weight reduction problems with certain bottleneck objectives.
- Upgrading the 1-center problem with edge length variables on a tree
- Upgrading min-max spanning tree problem under various cost functions
- The non-approximability of bicriteria network design problems
- Improving spanning trees by upgrading nodes
- Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks
- Graph simplification for infrastructure network design
- Location of speed-up subnetworks
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
- A class of node based bottleneck improvement problems
- Some inverse optimization problems under the Hamming distance
- On budget-constrained flow improvement.
- Bottleneck capacity expansion problems with general budget constraints
- Upgrading trees under diameter and budget constraints
- Upgrading edges in the graphical TSP
- The p-median problem with upgrading of transportation costs and minimum travel time allocation
- Speedup the optimization of maximal closure of a node-weighted directed acyclic graph
- Modifying networks to obtain low cost trees
- Some upgrading problems on networks related to eccentricity concept
- Exploring the discrete and continuous edge improvement problems: models and algorithms
- Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies
- Efficient algorithms for robustness in resource allocation and scheduling problems
- Optimizing cost flows by edge cost and capacity upgrade
- Upgrading \(p\)-median problem on a path
- Reverse 2-median problem on trees
This page was built for publication: Modifying edges of a network to obtain short subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274323)
