The following pages link to Online independent sets. (Q1853575):
Displaying 15 items.
- Streaming algorithms for independent sets in sparse hypergraphs (Q329293) (← links)
- Online selection of intervals and \(t\)-intervals (Q391644) (← links)
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Adding isolated vertices makes some greedy online algorithms optimal (Q1647831) (← links)
- The advice complexity of a class of hard online problems (Q1693995) (← links)
- Competitive algorithms for multistage online scheduling (Q1753459) (← links)
- On-line vertex-covering (Q1770381) (← links)
- Dynamic node packing (Q2097666) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- Parallel online algorithms for the bin packing problem (Q2700390) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- On-line models and algorithms for max independent set (Q3411297) (← links)
- On-line maximum-order induced hereditary subgraph problems (Q4670672) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
