Pages that link to "Item:Q5945920"
From MaRDI portal
The following pages link to An approximation algorithm for circular arc colouring (Q5945920):
Displaying 7 items.
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- An O(qn) algorithm to q-color a proper family of circular arcs (Q1060020) (← links)
- An \(0(n^{1.5})\) algorithm to color proper circular arcs (Q1824396) (← links)
- Approximate constrained bipartite edge coloring (Q1887041) (← links)
- Perfect circular arc coloring (Q2569164) (← links)
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem (Q3196382) (← links)
- Algorithms - ESA 2003 (Q5897231) (← links)