Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- 5 November 2009
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 22 (1) , 78-96
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREEInternational Journal of Foundations of Computer Science, 2007
- Balanced vertex-orderings of graphsDiscrete Applied Mathematics, 2005
- Minimizing maximum indegreeDiscrete Applied Mathematics, 2004
- Complexity of approximating the oriented diameter of chordal graphsJournal of Graph Theory, 2004
- Beyond the flow decomposition barrierJournal of the ACM, 1998
- A Faster Deterministic Maximum Flow AlgorithmJournal of Algorithms, 1994
- Planar orientations with low out-degree and compaction of adjacency matricesTheoretical Computer Science, 1991
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976
- A combinatorial theorem in plane geometryJournal of Combinatorial Theory, Series B, 1975