Pages that link to "Item:Q3815536"

The following pages link to The Linearity of First-Fit Coloring of Interval Graphs (Q3815536):

Displaying 43 items.

• A graph coloring approach to the deployment scheduling and unit assignment problem (Q283268) (← links)
• A coloring problem for weighted graphs (Q286971) (← links)
• On the performance of the first-fit coloring algorithm on permutation graphs (Q294842) (← links)
• First-fit chromatic numbers of \(d\)-degenerate graphs (Q427876) (← links)
• First-fit coloring on interval graphs has performance ratio at least 5 (Q499473) (← links)
• First-fit coloring of bounded tolerance graphs (Q531602) (← links)
• First-Fit is linear on posets excluding two long incomparable chains (Q651432) (← links)
• On the max coloring problem (Q690449) (← links)
• Single and multiple device DSA problems, complexities and online algorithms (Q764370) (← links)
• On-line chain partitions of orders: a survey (Q766153) (← links)
• Online promise problems with online width metrics (Q859981) (← links)
• A note on first-fit coloring of interval graphs (Q925259) (← links)
• Online interval coloring with packing constraints (Q954991) (← links)
• A note on the online first-fit algorithm for coloring \(k\)-inductive graphs (Q975523) (← links)
• Variable sized online interval coloring with bandwidth (Q1024785) (← links)
• Bounded families for the on-line \(t\)-relaxed coloring (Q1044722) (← links)
• An on-line graph coloring algorithm with sublinear performance ratio (Q1124602) (← links)
• A polynomial time approximation algorithm for dynamic storage allocation (Q1176726) (← links)
• The online graph bandwidth problem (Q1198951) (← links)
• The greedy algorithm is optimal for on-line edge coloring (Q1209350) (← links)
• Coloring inductive graphs on-line (Q1312187) (← links)
• On the mean chromatic number (Q1322240) (← links)
• On-line coloring of perfect graphs (Q1375694) (← links)
• On spectrum assignment in elastic optical tree-networks (Q1730219) (← links)
• An easy subexponential bound for online chain partitioning (Q1753118) (← links)
• Coloring interval graphs with First-Fit (Q1898342) (← links)
• On the on-line chromatic number of the family of on-line 3-chromatic graphs (Q1916112) (← links)
• On-line dimension for posets excluding two long incomparable chains (Q1943697) (← links)
• On-line routing in all-optical networks (Q1960517) (← links)
• On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains (Q2225405) (← links)
• Optimizing bandwidth allocation in elastic optical networks with application to scheduling (Q2407946) (← links)
• Inequalities for the Grundy chromatic number of graphs (Q2462396) (← links)
• Improved algorithms for scheduling unsplittable flows on paths (Q2684488) (← links)
• Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
• (Q2857340) (← links)
• A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
• Online Conflict-Free Colouring for Hypergraphs (Q4933597) (← links)
• An Improved Upper Bound for the Ring Loading Problem (Q5071092) (← links)
• (Q5136269) (← links)
• On the Max Coloring Problem (Q5443379) (← links)
• Dynamic storage allocation with known durations (Q5918029) (← links)
• An approximation result for a periodic allocation problem (Q5946816) (← links)
• On-line interval graphs coloring — Modification of the First-Fit algorithm and its performance ratio (Q6115748) (← links)