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 21 for “"Combinatorial Algorithms"”.

  1. Topics in Combinatorial Algorithms

    … importance in Computer Science. The study of algorithms includes the study of efficient data structures. This thesis deals with various aspects of combinatorial algorithms and data structures.

    uiuc Repository record for Topics in Combinatorial Algorithms (opens in a new tab)

  2. Combinatorial Algorithms in Scientific Computing

    This thesis highlighted combinatorial techniques in scientific computing as a research field full of interesting problems with real impact. From the scientific computing point of view, our results show that very significant computational savings can be achieved by employing combinatorial

    uiuc Repository record for Combinatorial Algorithms in Scientific Computing (opens in a new tab)

  3. Combinatorial algorithms for stacking problems

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Ocean Engineering, 1989.

    mit Repository record for Combinatorial algorithms for stacking problems (opens in a new tab)

  4. Topics in combinatorics and combinatorial algorithms

    In this dissertation we investigate three topics. The first is a structural parameter for partially ordered sets (posets). The parameter that we study is the interval number of a poset, denoted by i(P) for a poset P. The interval number is related to a well-studied poset parameter, partial order …

    uiuc Repository record for Topics in combinatorics and combinatorial algorithms (opens in a new tab)

  5. Combinatorial Algorithms for Server Allocation Problem

    … velocity is also given as input. We present new algorithms for the Euclidean bipartite matching problem, showing improvements over existing algorithms. In particular, for two point sets $A, B subset mathbb{R}^d$ with $|A| = |B| = n$ and dimension $d > 1$ being constant, we developed: …

    vt Repository record for Combinatorial Algorithms for Server Allocation Problem (opens in a new tab)

  6. Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming)

    This thesis is a study of a wide variety of combinatorial optimization problems.

    uiuc Repository record for Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming) (opens in a new tab)

  7. Topics in the Design and Analysis of Combinatorial Algorithms

    … presents topics in the analysis and design of Combinatorial Algorithms. The second chapter introduces a technique for obtaining more precise closed form solutions of recurrence relations defined by minimization and maximization operators. Since such recurrences arise quite frequently in the …

    uiuc Repository record for Topics in the Design and Analysis of Combinatorial Algorithms (opens in a new tab)

  8. Scalable Combinatorial Algorithms for Optimal Transport Based Similarity Metrics

    … In this document, we propose to use combinatorial methods to design scalable and noise-resistant solutions for OT. We present four key contributions in this work. First, we introduce a novel combinatorial parallel algorithm for approximating OT, which achieves a parallel time …

    vt Repository record for Scalable Combinatorial Algorithms for Optimal Transport Based Similarity Metrics (opens in a new tab)

  9. Combinatorial algorithms for perturbation theory and application on quantum computing

    … of this dissertation is then to analyze the combinatorial structure of the perturbation theory as it is used for perturbative reductions.</p>

    purdue-thes Repository record for Combinatorial algorithms for perturbation theory and application on quantum computing (opens in a new tab)

  10. A Separator-Based Framework for Graph Matching Problems

    … and n vertices, there are known, long-standing combinatorial algorithms that compute a maximum cardinality matching in O(m\sqrt{n}) time. For graphs with non-negative integer edge costs at most C, it is known how to compute a minimum-cost maximum cardinality matching in roughly O(m\sqrt{n} …

    vt Repository record for A Separator-Based Framework for Graph Matching Problems (opens in a new tab)

  11. Scheduling algorithms for throughput maximization in data networks

    … throughput optimality of scheduling and routing algorithms under stochastic traffic. Techniques of graph theory are used to study network topologies having desirable throughput properties. Combinatorial algorithms are proposed for efficient resource allocation. In the optical network setting, the …

    mit Repository record for Scheduling algorithms for throughput maximization in data networks (opens in a new tab)

  12. The Structural Representation of Three -Way Proximity Data

    … scaling and clustering can be reformulated as combinatorial data analytic tasks, solvable through discrete optimization strategies. We develop generalizations of combinatorial algorithms for analyzing individual differences through scaling and clustering three-way data that consist of …

    uiuc Repository record for The Structural Representation of Three -Way Proximity Data (opens in a new tab)

  13. Maximum-entropy principle approach to the multiple travelling salesman problem and related problems

    … particularly challenging for most conventional combinatorial algorithms. Concrete steps are presented by which to further extend and improve this framework to become both more widely applicable to variants on the travelling salesman problem, and more computationally efficient in solving such …

    uiuc Repository record for Maximum-entropy principle approach to the multiple travelling salesman problem and related problems (opens in a new tab)

  14. New geometric techniques for linear programming and graph partitioning

    … of new geometric techniques for the analysis of combinatorial algorithms. Using these techniques, we resolve several longstanding questions in the theory of linear programming, polytope theory, spectral graph theory, and graph partitioning. The thesis consists of two main parts. In the first …

    mit Repository record for New geometric techniques for linear programming and graph partitioning (opens in a new tab)

  15. Efficient Lagrangian relaxation algorithms for exact inference in natural language tasks

    … large set of possible structures. Solving these combinatorial search problems exactly can be inefficient, and so researchers often use approximate techniques at the cost of model accuracy. In this thesis, we turn to Lagrangian relaxation as an alternative to approximate inference in natural …

    mit Repository record for Efficient Lagrangian relaxation algorithms for exact inference in natural language tasks (opens in a new tab)

  16. Large-Scale Optimization Methods: Theory and Applications

    … their implicit bias. We illustrate that the combinatorial algorithms resulting from this approach can be used to solve sparse optimization problems.

    mit Repository record for Large-Scale Optimization Methods: Theory and Applications (opens in a new tab)

  17. Node-weighted prize-collecting survivable network design problems

    … and PC-ELC-SNDP and obtain approximation algorithms for PC-SNDP and PC-ELC-SNDP through them. The approximation ratios we obtain for PC-EC-SNDP are similar to those that were previously known for EC-SNDP via combinatorial algorithms. Specifically, for PC-EC-SNDP (and PC-ELC-SNDP) we obtain …

    uiuc Repository record for Node-weighted prize-collecting survivable network design problems (opens in a new tab)

  18. The Kinematics of Rigid Body Contact in the Design and Analysis of Machining Fixtures

    … location and good conditioning. Next, we develop combinatorial algorithms for the synthesis of near-optimal 3-2-1 locator schemes. We show that the search can be limited to the boundary of convex regions of valid locator positions specified on each datum face. In the second part, we are concerned …

    uiuc Repository record for The Kinematics of Rigid Body Contact in the Design and Analysis of Machining Fixtures (opens in a new tab)

  19. Equivariant Schubert calculus and applications

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms

    uiuc Repository record for Equivariant Schubert calculus and applications (opens in a new tab)

Page 1 of 2