Pages that link to "Item:Q4962703"

The following pages link to Improved bounds for scheduling conflicting jobs with minsum criteria (Q4962703):

Displaying 9 items.

• On a local protocol for concurrent file transfers (Q487273) (← links)
• On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
• On the performance guarantee of first fit for sum coloring (Q1628787) (← links)
• Improved bounds for randomized preemptive online matching (Q1706142) (← links)
• Non-clairvoyant scheduling with conflicts for unit-size jobs (Q1721929) (← links)
• Scheduling problems over a network of machines (Q2281619) (← links)
• A polynomial-time approximation scheme for the airplane refueling problem (Q2327962) (← links)
• Scheduling Problems over Network of Machines (Q5002605) (← links)
• Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512) (← links)