Pages that link to "Item:Q5434435"
From MaRDI portal
The following pages link to Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree (Q5434435):
Displaying 13 items.
- On finding orientations with the fewest number of vertices with small out-degree (Q494438) (← links)
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
- On the most imbalanced orientation of a graph (Q721946) (← links)
- A note on graph balancing problems with restrictions (Q990093) (← links)
- A 3/2-approximation algorithm for the graph balancing problem with two weights (Q1736801) (← links)
- On the complexity of finding well-balanced orientations with upper bounds on the out-degrees (Q2106523) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- The edge-orientation problem and some of its variants on weighted graphs (Q2509220) (← links)
- Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks (Q2568262) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- On the Most Imbalanced Orientation of a Graph (Q3196369) (← links)
- Parameterized Resiliency Problems via Integer Linear Programming (Q5283365) (← links)
