Search Results for author:
Found 4 papers, 0 papers with code
Accelerating Matroid Optimization through Fast Imprecise Oracles
In the fundamental problem of computing a maximum-weight basis of a matroid, a well-known generalization of many combinatorial optimization problems, algorithms have access to a clean oracle to query matroid information.
Sorting and Hypergraph Orientation under Uncertainty with Predictions
We study learning-augmented algorithms for sorting and hypergraph orientation under uncertainty, assuming access to untrusted predictions for the uncertain values.
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints
We consider non-clairvoyant scheduling with online precedence constraints, where an algorithm is oblivious to any job dependencies and learns about a job only if all of its predecessors have been completed.
Robustification of Online Graph Exploration Methods
Exploring unknown environments is a fundamental task in many domains, e. g., robot navigation, network security, and internet search.
