Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Year of publication: |
2011
|
---|---|
Authors: | Asahiro, Yuichi ; Jansson, Jesper ; Miyano, Eiji ; Ono, Hirotaka ; Zenmyo, Kouhei |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 22.2011, 1, p. 78-96
|
Subject: | Graphentheorie | Graph theory | Algorithmus | Algorithm | Operations Research | Operations research |
-
Fast Approximation Algorithms for Finding Node-Independent Paths in Networks
White, Douglas R., (2011)
-
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
Balasundaram, Balabhaskar, (2010)
-
A comparison of heuristic best-first algorithms for bicriterion shortest path problems
Machuca, E., (2012)
- More ...
-
Asahiro, Yuichi, (2010)
-
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation
Asahiro, Yuichi, (2013)
-
The robustest clusters in the input-output networks: Global CO2 emission clusters
Rifki, Omar, (2017)
- More ...