Browsing Combinatorics and Optimization by Subject "algorithms"
Now showing items 1-7 of 7
-
Algorithms for Analytic Combinatorics in Several Variables
(University of Waterloo, 2023-04-25)Given a multivariate rational generating function we are interested in computing asymptotic formulas for the sequences encoded by the coefficients. In this thesis we apply the theory of analytic combinatorics in several ... -
Combinatorial Algorithms for Submodular Function Minimization and Related Problems
(University of Waterloo, 2015-05-19)Submodular functions are common in combinatorics; examples include the cut capacity function of a graph and the rank function of a matroid. The submodular function minimization problem generalizes the classical minimum cut ... -
Computing the Nucleolus of Matching and b-Matching Games
(University of Waterloo, 2021-05-21)In the classical weighted matching problem the optimizer is given a graph with edge weights and their goal is to find a matching which maximizes the sum of the weights of edges in the matching. It is typically assumed in ... -
Continuous-time Quantum Algorithms: Searching and Adiabatic Computation
(University of Waterloo, 2002)One of the most important quantum algorithms is Grover's search algorithm [G96]. Quantum searching can be used to speed up the search for solutions to NP-complete problems e. g. 3SAT. Even so, the best known quantum ... -
Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization
(University of Waterloo, 2010-01-05)We study techniques, approximation algorithms, structural properties and lower bounds related to applications of linear programs in combinatorial optimization. The following "Steiner tree problem" is central: given a graph ... -
Morphing planar triangulations
(University of Waterloo, 2014-06-09)A morph between two drawings of the same graph can be thought of as a continuous deformation between the two given drawings. A morph is linear if every vertex moves along a straight line segment from its initial position ... -
Regularization Using a Parameterized Trust Region Subproblem
(University of Waterloo, 2004)We present a new method for regularization of ill-conditioned problems that extends the traditional trust-region approach. Ill-conditioned problems arise, for example, in image restoration or mathematical processing of ...