Priority algorithms with advice for disjoint path allocation problems
From MaRDI portal
Publication:6639746
Recommendations
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- (Incremental) priority algorithms
- Bounds on greedy algorithms for MAX SAT
- Call admission problems on grids with advice
- Call admission problems on trees
- How Much Information about the Future Is Needed?
- Information complexity of online problems
- Length-Weighted Disjoint Path Allocation
- Note on scheduling intervals on-line
- On the \(k\)-coloring of intervals
- On the power of advice and randomization for the disjoint path allocation problem
- Online algorithms with advice: the tape model
- Online computation with advice
- Priority algorithms for graph optimization problems
- Sur l'extension de l'ordre partiel.
- The power of priority algorithms for facility location and set cover
- The string guessing problem as a method to prove lower bounds on the advice complexity
This page was built for publication: Priority algorithms with advice for disjoint path allocation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6639746)