Pages that link to "Item:Q2464420"
From MaRDI portal
The following pages link to NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow (Q2464420):
Displayed 8 items.
- Equivalence of two linear programming relaxations for broadcast scheduling. (Q703264) (← links)
- Improved on-line broadcast scheduling with deadlines (Q835602) (← links)
- Single-source \(k\)-splittable min-cost flows (Q1015297) (← links)
- Minimum-cost single-source 2-splittable flow (Q1041715) (← links)
- Scheduling broadcasts with deadlines (Q1884847) (← links)
- Scheduling to minimize energy and flow time in broadcast scheduling (Q2018933) (← links)
- A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time (Q2498983) (← links)
- Minimum-Cost Single-Source 2-Splittable Flow (Q3439153) (← links)