Fast exact algorithms for survivable network design with uniform requirements
From MaRDI portal
Publication:5918784
DOI10.1007/s00453-022-00959-3OpenAlexW4281262673MaRDI QIDQ5918784
Pranabendu Misra, Akanksha Agrawal, Fahad Panolan, Saket Saurabh
Publication date: 18 August 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-00959-3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A parameterized view on matroid optimization problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A matroid approach to finding edge connectivity and packing arborescences
- Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
- Approximating Transitive Reductions for Directed Networks
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- On Network Augmentation
- A Graph Theoretic Approach to Statistical Data Security
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Biconnectivity approximations and graph carvings
- Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
- Fast Hamiltonicity Checking Via Bases of Perfect Matchings
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism
- Data Security Equals Graph Connectivity
- Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
- Parameterized Algorithms to Preserve Connectivity
- Multiplying matrices faster than coppersmith-winograd
- Determinant Sums for Undirected Hamiltonicity
- Parameterized Algorithms
- An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
This page was built for publication: Fast exact algorithms for survivable network design with uniform requirements
