Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
From MaRDI portal
Publication:2015788
DOI10.1007/s10878-012-9523-6zbMath1296.90134OpenAlexW2046654262MaRDI QIDQ2015788
Alexander Veremyev, Grigory Pastukhov, Vladimir L. Boginski, Eduardo L. Pasiliao
Publication date: 24 June 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9523-6
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (3)
The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures ⋮ On the number of edges in a graph with many two-hop disjoint paths ⋮ On the chance-constrained minimum spanning \(k\)-core problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The \(k\) edge-disjoint 3-hop-constrained paths polytope
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
- Hop-constrained node survivable network design: An application to MPLS over WDM
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
- Minimal oriented graphs of diameter 2
- On the directed hop-constrained shortest path problem
- New formulations and solution procedures for the hop constrained network design problem.
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
- Novel approaches for analyzing biological networks
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
- An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Augmentation Problems
- Edge-Connectivity Augmentation Preserving Simplicity
- The 2-path network problem
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
- Simpler and faster biconnectivity augmentation
- Robustness and Strong Attack Tolerance of Low-Diameter Networks
- On Critical Graphs of Diameter 2
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks