Route-Enabling Graph Orientation Problems
From MaRDI portal
Publication:3652228
DOI10.1007/978-3-642-10631-6_42zbMath1273.68410OpenAlexW1898304151MaRDI QIDQ3652228
Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Ryuhei Uehara, Hisao Tamaki
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_42
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (3)
Route-enabling graph orientation problems ⋮ Upper and lower degree-constrained graph orientation with minimum penalty ⋮ Min-sum 2-paths problems
This page was built for publication: Route-Enabling Graph Orientation Problems