Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 28 for “"Bipartite Matching"”.
-
Variations of online bipartite matching
The Online Bipartite Matching Problem is a well-studied problem in theoretical computer science that models several real-world applications including online investment, kidney transplantation, aviation security passenger screening, and enhanced Ebola entry screening. However, the original version …
-
Efficient algorithms for bipartite matching problems with preferences
Matching problems involve a set of participants, where each participant has a capacity and a subset of the participants rank a subset of the others in order of preference (strictly or with ties). Matching problems are motivated in practice by large-scale applications, such as automated matching …
-
Robust Exact Algorithms for the Euclidean Bipartite Matching Problem
The minimum cost bipartite matching problem is a well-studied optimization problem in computer science and operations research, with wide-ranging applications in fields such as machine learning, economics, transportation, logistics and biology. A special instance of this problem is the computation …
-
Warm Start Algorithms for Bipartite Matching and Optimal Transport
Minimum Cost Bipartite Matching and Optimal Transport are essential optimization challenges with applications in logistics, artificial intelligence, and multimodal data alignment. These problems involve finding efficient pairings while minimizing costs. Due to the combinatorial nature of …
-
Spatiotemporal random bipartite matching problems and applications in mobility systems
… presents new findings on a variant of bipartite matching problem, referred to as the Spatiotemporal Random Bipartite Matching Problem (ST-RBMP), which accommodates randomness and heterogeneity in the spatial distribution and temporal arrival of bipartite vertices. This fundamental …
-
Input Sensitive Analysis of a Minimum Metric Bipartite Matching Algorithm
… In this thesis, we consider the online bipartite matching problem where each server can serve exactly one request. In the online minimum metric bipartite matching problem, we are provided with a set of server locations in a metric space. Requests arrive one at a time that have to be …
-
A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs
Matching is one of the most fundamental algorithmic graph problems. Many variants of matching problems have been studied on different classes of graphs, the one of special interest to us being the Maximum Cardinality Bipartite Matching in Planar Graphs. In this work, we present a novel …
-
Empirical Analysis of Algorithms for the k-Server and Online Bipartite Matching Problems
… This algorithm is motivated by the Robust-Matching Algorithm [RMAlgorithm, Raghvendra, APPROX 2016] for the closely related online bipartite matching problem. We then give a comprehensive experimental analysis of this algorithm and also provide a graphical user interface which can be used …
-
Overcoming Computational Complexity Barriers for Optimal Transport in Discrete and Semi-Discrete Settings
… the problem is equivalent to the minimum-cost bipartite matching problem. In this thesis, we study the semi-discrete OT and the minimum-cost bipartite matching problems. The sensitivity of OT to noise has motivated the study of robust variants. Two such formulations are: (i) the $alpha$-optimal …
-
A novel weighted rank aggregation algorithm with applications in gene prioritization
… methods based on PageRank and Weighted Bipartite Matching. Finally, we illustrate the performance of the aggregation method on a set of test genes pertaining to the Bardet-Biedl syndrome, schizophrenia, and HIV and show that the combinatorial method matches or outperforms state-of-the …
-
Combinatorial Algorithms for Server Allocation Problem
… metric, the problem reduces to the Euclidean bipartite matching problem. When the capacity is $infty$, suppose we are also provided with the order in which requests are to be served, the problem is the $k$-first come first served routing problem. We also consider a generalization of the …
-
Competitive algorithms for online matching and vertex cover problems
… witnessed an explosion of research on the online bipartite matching problem. Surprisingly, its dual problem, online bipartite vertex cover, has never been explicitly studied before. One of the motivation for studying this problem is that it significantly generalizes the classical ski rental …
-
Stochastic Assignment with Expiration
… introduces a capacitated online stochastic bipartite matching problem, where offline nodes may be matched multiple times and expire at unknown stochastic times. This problem is PSPACE hard; thus we first focus on the subproblem where each offline node can be matched at most once and aim to …
-
Topics in quantum algorithms : adiabatic algorithm, quantum money, and bomb query complexity
… complexity, which we applied on the maximum bipartite matching problem to get an algorithm with O(n1.75) quantum query complexity, improving from the best known trivial O(n2 ) upper bound.
-
Dynamic systems and subadditive functionals
… Traveling Salesperson Problem (TSP) and Minimum Bipartite Matching Problem (MBMP) for dynamic systems.
-
Braid groups and mapping class groups for 2-orbifolds
… braid groups and we analyze the connectivity of bipartite matching complexes of $\Gamma$-arcs. This allows us to deduce highly generating families of subgroups in Map$_n^{id,orb}$($\\Sigma_\\Gamma$($L$)). For $Z_n$($\\Sigma_\\Gamma$($L$)) and the contained Artin groups, we also obtain a highly …
-
Timing Analysis and Behavioral Synthesis with Process Variation
… the functional unit level. Second, it offers a bipartite matching formulation for variation-aware binding in high-level synthesis. Last, it presents a statistical timing-driven floorplanner that is used to obtain correlation and interconnect information for more accurate timing analysis.
-
Alternative models for quantum computation/
… for single-source shortest paths and maximum bipartite matching. Normalizer circuits are a class of restricted quantum circuits defined on Hilbert spaces associated with Abelian groups. These circuits generalize the Clifford group, and are composed of gates implementing quantum Fourier …
-
Probabilistic on-line transportation problems with carrying-capacity constraints
… and new probabilistic cost bounds, for optimal bipartite matchings between large sets of random points and optimal stacker crane tours through large sets of random demands. A recurrent theme of the thesis is that capacity-constrained vehicles must drive passenger-less, inescapably, for some …
-
Bilateral exchanges in social networks and the design of public institutions
… this thesis, I focus on exclusive exchanges or matching in bipartite networks where the matched couples perform an economic exchange with each other. This thesis makes three contributions to matching theory. First, I relax the standard assumptions of costless transfers between matched couples …
Page 1 of 2