An algorithm for minimum cost arc-connectivity orientations
From MaRDI portal
Publication:848842
DOI10.1007/S00453-008-9179-XzbMATH Open1187.05043OpenAlexW2075939699MaRDI QIDQ848842FDOQ848842
Authors: Satoru Iwata, Yusuke Kobayashi 
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9179-x
Recommendations
- On orientations maximizing total arc-connectivity
- Approximating Minimum Cost Connectivity Orientation and Augmentation
- Approximating minimum cost connectivity orientation and augmentation
- Faster algorithms for minimum-link paths with restricted orientations
- Approximation algorithms for the arc orienteering problem
- scientific article; zbMATH DE number 56364
- Minimum cost disjoint paths under arc dependences. Algorithms for practice.
- Publication:4886063
- An approximation algorithm for minimum-cost vertex-connectivity problems
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Cites Work
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- Title not available (Why is that?)
- Matrix multiplication via arithmetic progressions
- A matroid approach to finding edge connectivity and packing arborescences
- A Minimax Theorem for Directed Graphs
- On two minimax theorems in graph
- Centroids, Representations, and Submodular Flows
- How to make a digraph strongly connected
- An Algorithm for Submodular Functions on Graphs
- Title not available (Why is that?)
Cited In (10)
- Enumerating \(k\)-arc-connected orientations
- Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
- Approximating minimum cost connectivity orientation and augmentation
- Fractional packing in ideal clutters
- Fast edge orientation for unweighted graphs
- On 2-strong connectivity orientations of mixed graphs and related problems
- Using Four Cost Measures to Determine Arc Reversal Orderings
- Title not available (Why is that?)
- Fast cycle canceling algorithms for minimum cost submodular flow
- Approximating Minimum Cost Connectivity Orientation and Augmentation
This page was built for publication: An algorithm for minimum cost arc-connectivity orientations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848842)
