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 4 of 4 for “"APX hardness"”.

  1. Υπολογιστικά ζητήματα σε στρατηγικά παίγνια και διαδικασίες κοινωνικής επιλογής

    … in the single-item setting. We prove a strong APX-hardness result that applies to the 3-player case. We furthermore give a separation result between the revenue of deterministic and randomized optimal auctions.

    greece Repository record for Υπολογιστικά ζητήματα σε στρατηγικά παίγνια και διαδικασίες κοινωνικής επιλογής (opens in a new tab)

  2. Covering Problems via Structural Approaches

    … problems in computer science. Its theoretical hardness has been fully characterized--logarithmic approximability has been established, and no sublogarithmic approximation exists unless P=NP. However, the gap between real-world instances and the theoretical worst case is often immense--many …

    waterloo Repository record for Covering Problems via Structural Approaches (opens in a new tab)

  3. Turán Triangles, Cell Covers, Road Placement and Train Scheduling

    … cells it is incident to. Recently, a PTAS, an APX -hardness proof and a FPT algorithm for variants of this problem have been shown. This paper and a new slight generalization of one of its results is included as a chapter. The third problem has been posed in the Sixth Annual Workshop on …

    ottawa-retro Repository record for Turán Triangles, Cell Covers, Road Placement and Train Scheduling (opens in a new tab)

  4. Temporal graphs

    This thesis studies Temporal Graphs, also called Temporal Networks. More specifically, the project aimed to carry out research on the properties of Temporal Graphs, both in general and in specific classes of the model, as well as examine and develop algorithms for solving problems in temporal graph …

    greece Repository record for Temporal graphs (opens in a new tab)