Edge Weight Reduction Problems in Directed Acyclic Graphs
From MaRDI portal
Recommendations
- Edge elimination and weighted graph classes
- scientific article; zbMATH DE number 2190098
- Rank reduction of directed graphs by vertex and edge deletions
- On weighted directed graphs
- On a max-min problem concerning weights of edges
- Edge searching weighted graphs
- The edge-orientation problem and some of its variants on weighted graphs
- scientific article; zbMATH DE number 426346
- Directed acyclic graphs with edge-specific bounds
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
Cited in
(17)- Up- and downgrading the 1-center in a network
- Modifying edges of a network to obtain short subgraphs
- Minimizing broadcast costs under edge reductions in tree networks
- Upgrading the 1-center problem with edge length variables on a tree
- Upgrading min-max spanning tree problem under various cost functions
- Improving spanning trees by upgrading nodes
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted l₁ norm
- Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
- On budget-constrained flow improvement.
- Deleting vertices to bound path length
- 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
- Some upgrading problems on networks related to eccentricity concept
- Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies
- Upgrading \(p\)-median problem on a path
This page was built for publication: Edge Weight Reduction Problems in Directed Acyclic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4349699)
