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 32 for “"Matching problems"”.
-
Matching problems in hypergraphs
… 2} - {2n/3 choose 2}, then H contains a perfect matching. We show that for sufficiently large n divisible by 3, if F_1, ..., F_{n/3} are 3-uniform hypergraphs with a common vertex set and the minimum vertex degree in each F_i is greater than {(n-1) choose 2} - {2n/3 choose 2} for i = 1, ..., n/3, …
-
Algorithmic aspects of stable matching problems
… problem (SR) are three classical stable matching problems that were first studied by Gale and Shapley in 1962. These problems have widespread practical application in centralised automated matching schemes, which assign applicants to posts based on preference lists and capacity …
-
A specialised constraint approach for stable matching problems
… framework designed to solve combinatorial problems. This framework is made up of a set of predefined independent components and generalised algorithms. This is a very versatile structure which allows for a variety of rich combinatorial problems to be represented and solved relatively …
-
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 …
-
A Separator-Based Framework for Graph Matching Problems
Given a graph, a matching is a set of vertex-disjoint edges. Graph matchings have been well studied, since they play a fundamental role in algorithmic theory as well as motivate many practical applications. Of particular interest is the problem of finding a maximum cardinality matching of a graph. …
-
Investigation of matching problems using constraint programming and optimisation methods
This thesis focuses on matching under ordinal preferences, i.e. problems where agents may be required to list other agents that they find acceptable in order of preference. In particular, we focus on two main cases: the popular matching and the kidney exchange problem. These problems are important …
-
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 problem has …
-
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 …
-
Online optimization problems
In this thesis, we study online optimization problems in routing and allocation applications. Online problems are problems where information is revealed incrementally, and decisions must be made before all information is available. We design and analyze algorithms for a variety of online problems, …
-
An approach to robustness in stable marriage and stable roommates problems
… concept of robustness within the context of matching problems. Our robustness notion for the stable matching framework is motivated by the unforeseen events that may occur after a matching is computed. We define the notion of (a,b)-supermatches as a measure of robustness of a matching. An …
-
Best matching processes in distributed systems
… This research refers to this problem as <em>best matching, </em>and investigates it as a major design principle of CCT, the Collaborative Control Theory.</p> <p>The original contribution of this research is to elaborate on the fundamentals of best matching in distributed and collaborative systems, …
-
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 …
-
A blocked orthogonalization method for nonlinear regression
… developed in this work results from a study of matching problems having certain identifiable characteristics with algorithms which exploit those characteristics. The new algorithm represents an extension of an earlier algorithm by D. S. Grey using a blocked orthogonalization technique proposed …
-
Essays on economic design and coalition formation
… chapter studies the stability of many-to-one matching, such as matching between students and colleges or interns and hospitals. Complementarities and peer effects are inherent in many such matching situations. The chapter provides the first sufficient condition for stability that may be used …
-
Min Cost Flow in balancierten Netzwerken mit konvexer Kostenfunktion
Standard matching problems can be stated in terms of skew symmetric networks. On skew symmetric networks matching problems can be solved using network flow techniques. We consider the problem of minimizing a separable convex objective function over a skew-symmetric network with a balanced flow. We …
-
Essays in Computational Econometrics
… presents methods that relate to computational problems arising in econometric theory or applications. In the first essay, an improved Bayesian method for probabilistic record linkage in large matching problems, with an accompanying implementation in R/C++, is presented. The method refines the …
-
Innovative Combinatorial Strategies for the Synthesis of Radar Tracking Antenna Systems
… difference patterns through an excitation matching procedure. By exploiting some properties of the solution space, the synthesis problem is reformulated as a combinatorial one to allow a considerable saving of computational resources. Thanks to a graph-based representation of the solution …
-
Shortest paths, Markov chains, matrix scaling and beyond : improved algorithms through the lens of continuous optimization
… progress on a number of fundamental algorithmic problems: *-- We develop a faster algorithm for the unit capacity minimum cost flow problem, which encompasses the shortest path with negative weights and minimum cost bipartite perfect matching problems. In the case of sparse graphs, this provides …
-
Exploring the Process and Challenges of Programming with Regular Expressions
… are a powerful mechanism for solving string-matching problems and are supported by all modern programming languages. While regular expressions are highly expressive, they are also often perceived to be highly complex and hard to read. While existing studies have focused on improving the …
Page 1 of 2