S
Sashka Davis
Researcher at University of California, San Diego
Publications - 6
Citations - 129
Sashka Davis is an academic researcher from University of California, San Diego. The author has contributed to research in topics: Approximation algorithm & Vertex cover. The author has an hindex of 5, co-authored 6 publications receiving 126 citations.
Papers
More filters
Journal Article
Models of Greedy Algorithms for Graph Problems
Sashka Davis,Russell Impagliazzo +1 more
TL;DR: Angelopoulos and Borodin this paper generalize their model to include other optimization problems, and apply the generalized framework to graph problems, including shortest path, weighted vertex cover, Steiner tree, and independent set.
Proceedings ArticleDOI
Models of greedy algorithms for graph problems
Sashka Davis,Russell Impagliazzo +1 more
TL;DR: The goal is to define an abstract model that captures the intrinsic power and limitations of greedy algorithms for various graph optimization problems, as Borodin et al. (Algorithmica 37(4):295–326, 2003) did for scheduling.
Journal ArticleDOI
Models of Greedy Algorithms for Graph Problems
Sashka Davis,Russell Impagliazzo +1 more
TL;DR: Angelopoulos and Borodin this paper generalize their model to include other optimization problems, and apply the generalized framework to graph problems, including shortest path, weighted vertex cover, Steiner tree, and independent set.
Journal ArticleDOI
A Stronger Model of Dynamic Programming Algorithms
TL;DR: A formal model of dynamic programming algorithms which is a generalization of the BT model and proves that bipartite matching cannot be efficiently computed in it, suggesting that there are problems that can be solved efficiently by network flow algorithms and by simple linear programming that cannot be solved by natural dynamic programming approaches.
Book ChapterDOI
Online algorithms to minimize resource reallocations and network communication
TL;DR: The online randomized algorithm for the RAP problem is adapted to solve TMAV problem with similar competitive ratio: an algorithm can maintain sT precision and be O(logsn)-competitive in transmissions against an adversary maintaining precision T.