Pages that link to "Item:Q1893157"

The following pages link to On the \(k\)-coloring of intervals (Q1893157):

Displaying 50 items.

• Online scheduling of jobs with fixed start times on related machines (Q261353) (← links)
• Refined algorithms for hitting many intervals (Q344570) (← links)
• Algorithms for interval structures with applications (Q388095) (← links)
• Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
• Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← links)
• The just-in-time scheduling problem in a flow-shop scheduling system (Q421784) (← links)
• Interval scheduling on related machines (Q547142) (← links)
• Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines (Q600836) (← links)
• The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
• Maximizing profits of routing in WDM networks (Q813327) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• Shortest color-spanning intervals (Q896153) (← links)
• Bicriteria scheduling for contiguous and non contiguous parallel tasks (Q940878) (← links)
• Characterizing sets of jobs that admit optimal greedy-like algorithms (Q964871) (← links)
• About equivalent interval colorings of weighted graphs (Q967426) (← links)
• Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
• Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs (Q976121) (← links)
• 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings (Q976131) (← links)
• Improved randomized results for the interval selection problem (Q986549) (← links)
• Some approximation algorithms for the clique partition problem in weighted interval graphs (Q995565) (← links)
• Colouring relatives of intervals on the plane. II: Intervals and rays in two directions (Q1348767) (← links)
• Optimal channel allocation for several types of cellular radio networks (Q1372738) (← links)
• Description and generation of all minimal colorings of an interval graph, and the solution of related problems. (Q1425893) (← links)
• Online interval scheduling with a bounded number of failures (Q1707823) (← links)
• Competitive algorithms for multistage online scheduling (Q1753459) (← links)
• Balanced splitting on weighted intervals (Q1785388) (← links)
• Call control with \(k\) rejections (Q1877703) (← links)
• A unified model and algorithms for temporal map labeling (Q2006937) (← links)
• A simple and effective hybrid genetic search for the job sequencing and tool switching problem (Q2027021) (← links)
• Interval scheduling with economies of scale (Q2108158) (← links)
• On the tractability of \(( k , i )\)-coloring (Q2235289) (← links)
• Multistage interval scheduling games (Q2283299) (← links)
• Online interval scheduling to maximize total satisfaction (Q2285162) (← links)
• On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
• Models and algorithms for energy-efficient scheduling with immediate start of jobs (Q2317131) (← links)
• On packing and coloring hyperedges in a cycle (Q2384398) (← links)
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
• Online interval scheduling on two related machines: the power of lookahead (Q2424805) (← links)
• Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
• AFSCN scheduling: how the problem and solution have evolved (Q2473179) (← links)
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
• Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
• The prize-collecting call control problem on weighted lines and rings (Q2798111) (← links)
• \(k\)-colouring when \(k\) is close to \(\Delta\) (Q2816123) (← links)
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
• (Q2959659) (← links)
• Demand Hitting and Covering of Intervals (Q2971657) (← links)
• An experimental study of maximum profit wavelength assignment in WDM rings (Q3008923) (← links)
• (Q3009077) (← links)
• Wavelength assignment in multifiber star networks (Q3057165) (← links)