Pages that link to "Item:Q543514"
From MaRDI portal
The following pages link to Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514):
Displaying 16 items.
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Restricted assignment scheduling with resource constraints (Q1713408) (← links)
- A 3/2-approximation algorithm for the graph balancing problem with two weights (Q1736801) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- Makespan minimization on unrelated parallel machines with a few bags (Q2173300) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- Approximation algorithms for the graph balancing problem with two speeds and two job lengths (Q2424664) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- (Q5091233) (← links)
- (Q5116488) (← links)
- Graph Orientation with Edge Modifications (Q5859684) (← links)
- Graph orientation with splits (Q5918973) (← links)
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (Q5919347) (← links)
- Shortest longest-path graph orientations (Q6591464) (← links)
