The following pages link to On-line vertex-covering (Q1770381):
Displaying 17 items.
- Online maximum \(k\)-coverage (Q442204) (← links)
- A better list heuristic for vertex cover (Q963417) (← links)
- Mean analysis of an online algorithm for the vertex cover problem (Q987781) (← links)
- Adding isolated vertices makes some greedy online algorithms optimal (Q1647831) (← links)
- The advice complexity of a class of hard online problems (Q1693995) (← links)
- Online variable sized covering (Q1854485) (← links)
- Online node- and edge-deletion problems with advice (Q1979452) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- Paging with request sets (Q2272199) (← links)
- Algorithm for online 3-path vertex cover (Q2300630) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (Q3448861) (← links)
- On-line maximum-order induced hereditary subgraph problems (Q4670672) (← links)
- Further Results on Online Node- and Edge-Deletion Problems with Advice (Q5041186) (← links)
- (Q5240128) (← links)
- Relaxing the irrevocability requirement for online graph algorithms (Q5918715) (← links)
- Delaying decisions and reservation costs (Q6591489) (← links)
