Graph orientation to maximize the minimum weighted outdegree
From MaRDI portal
Publication:2997922
Recommendations
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- Graph orientations optimizing the number of light or heavy vertices
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
- Beyond the flow decomposition barrier
- Complexity of automaton identification from given data
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
- Handbook of Graph Theory
- Minimizing maximum indegree
- Planar Formulae and Their Uses
- The Recognition of Series Parallel Digraphs
Cited in
(9)- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
- Graph balancing: a special case of scheduling unrelated parallel machines
- Graph orientation with edge modifications
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- Graph orientation with splits
- Graph orientation with splits
This page was built for publication: Graph orientation to maximize the minimum weighted outdegree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997922)