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 “"Approximation Ratios"”.

  1. Techniques for Proving Approximation Ratios in Scheduling

    … machines is an NP-hard problem. Several approximation algorithms have been suggested for this problem. We focus on algorithms that are fast and easy to implement, rather than on more involved algorithms that might provide tighter approximation bounds. A set of approaches for proving …

    waterloo Repository record for Techniques for Proving Approximation Ratios in Scheduling (opens in a new tab)

  2. Approximation algorithms for packing and scheduling problems

    … One way of overcoming this dilemma is using approximation algorithms. These algorithms have a polynomial running time, but their solutions are in general not optimal but rather close to an optimum. The main subject of this thesis is approximation algorithms for packing and scheduling …

    cau-kiel Repository record for Approximation algorithms for packing and scheduling problems (opens in a new tab)

  3. Σχεδόν βέλτιστοι αλγόριθμοι και αποτελέσματα μη-προσέγγισης για προβλήματα κάλυψης πολυγωνικών περιοχών

    … greedy approach, we construct polynomial time approximation algorithms that achieve constant approximation ratios. We present also a gap preserving reduction from a well-known APX-hard problem to the problem of maximizing the covered length of the polygon’s boundary, using k vertex guards. The …

    greece Repository record for Σχεδόν βέλτιστοι αλγόριθμοι και αποτελέσματα μη-προσέγγισης για προβλήματα κάλυψης πολυγωνικών περιοχών (opens in a new tab)

  4. Differentially Private Approximation Algorithms for Facility Location Problem

    … ϵ-DP algorithm achieving O(1/square root of ϵ)-approximation ratio, and there is a non-interactive ϵ-LDP algorithm achieving O(n to the 1/4 power/ϵ squared)-approximation ratio, where n is the size of the metric. On the negative side, we show lower bounds of Ω(1/square root of ϵ) and Ω(n/ to the …

    buffalo Repository record for Differentially Private Approximation Algorithms for Facility Location Problem (opens in a new tab)

  5. Pattern extraction and clustering for high-dimensional discrete data

    … are NP-hard. Our goal is to develop effective approximation algorithms with good theoretical properties and apply them to solve various real application problems. We reformulate each of the problems as a special clustering problem that has the same optimal solution as the corresponding original …

    uiuc Repository record for Pattern extraction and clustering for high-dimensional discrete data (opens in a new tab)

  6. From Worst-Case to Average-Case Efficiency – Approximating Combinatorial Optimization Problems

    … notions of efficiency. For the three problems, approximation algorithms are given, which guarantee approximation ratios that are unachievable by worst-case efficient algorithms under reasonable complexity-theoretic assumptions. The algorithms achieve polynomial expected running time for …

    qucosa-diss

  7. Variations of online bipartite matching

    … model and provide algorithms with constant approximation ratios when job lengths are constant.

    uiuc Repository record for Variations of online bipartite matching (opens in a new tab)

  8. Algorithmic and mechanism design aspects of problems with limited -or no - payments

    … a partition so that each agent is guaranteed an approximation of his maximin share. Our main algorithmic result is a 2/3-approximation algorithm, that runs in polynomial time for any number of agents and items. Furthermore, we undertake a probabilistic analysis and provide a theoretical …

    greece Repository record for Algorithmic and mechanism design aspects of problems with limited -or no - payments (opens in a new tab)

  9. Approximating barrier resilience and related notions for disk sensors in a two-dimensional plane

    … work by Bereg and Kirkpatrick proved that a 3-approximation of the resilience could be guaranteed by a polynomial time algorithm when sensors are unit disks in the plane. This was tightened to a 5/3-approximation when S and T are well-separated. In this thesis, we define and analyze a …

    ubc Repository record for Approximating barrier resilience and related notions for disk sensors in a two-dimensional plane (opens in a new tab) Download PDF for Approximating barrier resilience and related notions for disk sensors in a two-dimensional plane (opens in a new tab)

  10. Approximation algorithms for scheduling and two-dimensional packing problems

    … notoriously hard to tackle; we present improved approximation ratios for several special cases. In particular, we derive a polynomial-time approximation scheme for nested interval restrictions, which occur naturally in many practical applications. Our final topic is two-dimensional geometric bin …

    cau-kiel Repository record for Approximation algorithms for scheduling and two-dimensional packing problems (opens in a new tab)

  11. Multi-Level Graph Spanners

    … simple top-down and bottom-up approaches, have approximation ratios $\frac{\ell+1}{2}$ and $\ell$, which depend on the number of levels $\ell$. The composite approach provides the best approximation ratio of $2.351$ for $\ell \leq 100$, however, at the expense of higher runtime complexity. The …

    arizona-thes Repository record for Multi-Level Graph Spanners (opens in a new tab)

  12. Implementation and Performance Comparison of Some Heuristic Algorithms for Block Sorting

    … on the development and analysis of several approximation algorithms for Block Sorting, little or no work has been carried out thus far on the implementation of the proposed approximation algorithms. The conceptualization of an implementation framework and illustrating its use by …

    unf Repository record for Implementation and Performance Comparison of Some Heuristic Algorithms for Block Sorting (opens in a new tab) Download PDF for Implementation and Performance Comparison of Some Heuristic Algorithms for Block Sorting (opens in a new tab)

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

    … requirement. There has been no non-trivial approximation for node-weighted PC-SNDP for $k > 1$ even in edge-connectivity setup. We describe multiroute-flow based relaxations for PC-EC-SNDP and PC-ELC-SNDP and obtain approximation algorithms for PC-SNDP and PC-ELC-SNDP through them. The …

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

  14. Approximation algorithms for independent set problems on hypergraphs

    This thesis deals with approximation algorithms for the Maximum Independent Set and the Minimum Hitting Set problems on hypergraphs. As a hypergraph is a generalization of a graph, the question is whether the best known approximations on graphs can be extended to hypergraphs. We consider greedy, …

    reykjavik Repository record for Approximation algorithms for independent set problems on hypergraphs (opens in a new tab)

  15. Sorting by Strip Moves and Strip Swaps

    … on obtaining hardness results or designing approximation algorithms, with little work carried out thus far on the implementation of the proposed approximation algorithms. This research starts with implementing two existing algorithms [5, 34] and as the main contributions, provides two new …

    unf Repository record for Sorting by Strip Moves and Strip Swaps (opens in a new tab) Download PDF for Sorting by Strip Moves and Strip Swaps (opens in a new tab)

  16. Parameterized Algorithms for Integer Linear Programs and Their Applications for Allocation Problems

    … efficiently. The first approach aims to design approximation algorithms, that is, we are content to find good, but non-optimal solutions in polynomial time. The second strategy is called Fixed-Parameter Tractability (FPT) and considers parameters of the instance to capture the hardness of the …

    cau-kiel Repository record for Parameterized Algorithms for Integer Linear Programs and Their Applications for Allocation Problems (opens in a new tab)

  17. Fair and diverse data representation in machine learning

    … algorithms, improving upon best previous approximation ratios in the literature. We also show that the A-optimal design problem is NP-hard to approximate within a fixed constant when k = d. One of the most common heuristics used in practice to solve A and D-optimal design problems is the …

    gatech Repository record for Fair and diverse data representation in machine learning (opens in a new tab)

  18. FROM HARDNESS TO STRUCTURE: ALGORITHMIC INSIGHTS FROM SAT, DIVERSITY, AND CONNECTIVITY

    … algorithms that achieve near-optimal approximation ratios for selecting well-separated subsets in metric spaces, specifically a $(2/\varepsilon)$-approximation for sufficiently large instances, improving upon the best-known randomized bounds and establishing tight lower limits. These …

    maryland Repository record for FROM HARDNESS TO STRUCTURE: ALGORITHMIC INSIGHTS FROM SAT, DIVERSITY, AND CONNECTIVITY (opens in a new tab)

  19. Polynomial optimization: structures, algorithms, and engineering applications

    … probability inequalities lead to new approximation algorithms with better approximation ratios than the ones known in the literature. We also propose approximation algorithms for polynomial optimization in complex variables. At the same time, we consider first order algorithms such as …

    umn Repository record for Polynomial optimization: structures, algorithms, and engineering applications (opens in a new tab)

  20. Coordinated Packet-Level Traffic Monitoring in Software-Defined Networks

    … configurations, we design polynomial time approximation algorithms with bounded approximation ratios. Our Mininet experiments show that an intrusion detection system implemented on top of SoftTap achieves up to 25% higher detection recall compared to existing mirroring solutions. To reduce …

    calgary Repository record for Coordinated Packet-Level Traffic Monitoring in Software-Defined Networks (opens in a new tab)

Page 1 of 2