Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

DOI10.1007/978-3-642-31265-6_6zbMath1358.68319OpenAlexW142788616MaRDI QIDQ2904480

Roded Sharan, Danny Segev, Dima Blokh

Publication date: 14 August 2012

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31265-6_6

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Systems biology, networks (92C42)

Related Items (1)

Improved approximation for orienting mixed graphs

This page was built for publication: Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations