JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing by Author "Sharp, Alexa"
Now showing items 16 of 6

Birthdays, Broadcasts, and Boolean Algebras: Probabilistic Boolean Algebras and Applications
Sharp, Alexa (Cornell University, 20061011)In the area of extremal finite set theory there are many combinatorial results concerning the selection of m kelement sets. This type of set selection can also be viewed as a boolean algebra. In this paper we consider ... 
Distance Coloring
Sharp, Alexa (Cornell University, 20070202)Given a graph G=(V,E), a (d,k)coloring is an assignment of a color from {1, 2, ..., k} to each vertex of V such that any two vertices within distance d of each other are assigned different colors. We determine the ... 
Hierarchical Flow
Hartline, Jeff; Sharp, Alexa (Cornell University, 20040929)This paper defines a hierarchical version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that build on each other incrementally. Thus far, ... 
An Incremental Model for Combinatorial Maximization Problems
Hartline, Jeff; Sharp, Alexa (Cornell University, 20051026)Many combinatorial optimization problems aim to select a subset of elements of maximum value subject to certain constraints. We consider an incremental version of such problems, in which some of the constraints rise over ... 
An Incremental Model for Combinatorial Minimization
Hartline, Jeff; Sharp, Alexa (Cornell University, 20060705)Traditional optimization algorithms are concerned with static input, static constraints, and attempt to produce static output of optimal value. Recent literature has strayed from this conventional approach to deal with ... 
On Distance Coloring
Kozen, Dexter; Sharp, Alexa (Cornell University, 20070629)Call a connected undirected graph (d,c)colorable if there is a vertex coloring using at most c colors such that no two vertices of distance d or less have the same color. It is well known that (1,2)colorability is ...