๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree

โœ Scribed by Yuichi Asahiro; Jesper Jansson; Eiji Miyano; Hirotaka Ono; Kouhei Zenmyo


Publisher
Springer US
Year
2009
Tongue
English
Weight
717 KB
Volume
22
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On minimizing the maximum congestion for
โœ SingLing Lee; Hann-Jang Ho ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 77 KB

The problem of Weighted Hypergraph Embedding in a Cycle (WHEC) is to embed the weighted hyperedges of a hypergraph as adjacent paths around a cycle, such that the maximum congestion over any physical link in the cycle is minimized. In this paper, we first show that even when hyperedges contain exact