Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree

DOI10.1007/978-3-540-72870-2_16zbMath1137.68462OpenAlexW1506627918MaRDI QIDQ5434435

Hirotaka Ono, Kouhei Zenmyo, Jesper Jansson, Yuichi Asahiro, Eiji Miyano

Publication date: 4 January 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72870-2_16

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (8)

Parameterized Resiliency Problems via Integer Linear Programming ⋮ On the Most Imbalanced Orientation of a Graph ⋮ Graph balancing: a special case of scheduling unrelated parallel machines ⋮ A 3/2-approximation algorithm for the graph balancing problem with two weights ⋮ Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree ⋮ A note on graph balancing problems with restrictions ⋮ On the most imbalanced orientation of a graph ⋮ Parameterized resiliency problems

This page was built for publication: Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree