Search Results for author:
Found 6 papers, 0 papers with code
The Parameterized Complexity of Coordinated Motion Planning
The goal is to compute a schedule for moving the $k$ robots to their destinations which minimizes a certain objective target - prominently the number of time steps in the schedule, i. e., the makespan, or the total length traveled by the robots.
The Computational Complexity of Concise Hypersphere Classification
Hypersphere classification is a classical and foundational method that can provide easy-to-process explanations for the classification of real-valued and binary data.
Optimal Streaming Algorithms for Graph Matching
For the dynamic streaming model, we present a one-pass algorithm that, with high probability, computes a maximum-weight $k$-matching of a weighted graph in $\tilde{O}(Wk^2)$ space and that has $\tilde{O}(1)$ update time, where $W$ is the number of distinct edge weights and the notation $\tilde{O}()$ hides a poly-logarithmic factor in the input size.
Graph Matching
Data Structures and Algorithms
Computational Complexity
Near-Optimal Algorithms for Point-Line Covering Problems
Both algorithms improve the running time of existing kernelization algorithms for Line Cover.
Computational Geometry Data Structures and Algorithms
The Parameterized Complexity of Cascading Portfolio Scheduling
Cascading portfolio scheduling is a static algorithm selection strategy which uses a sample of test instances to compute an optimal ordering (a cascading schedule) of a portfolio of available algorithms.
Local Backbones
The empirical results we obtain show that a large fraction of the backbones of structured SAT instances are local, in contrast to random instances, which appear to have few local backbones.
