• Login
    View Item 
    •   Home
    • Brock Theses
    • Masters Theses
    • M.Sc. Computer Science
    • View Item
    •   Home
    • Brock Theses
    • Masters Theses
    • M.Sc. Computer Science
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of BrockUCommunitiesPublication DateAuthorsTitlesSubjectsThis CollectionPublication DateAuthorsTitlesSubjectsProfilesView

    My Account

    LoginRegister

    Statistics

    Display statistics

    Approximation Algorithms using Allegories and Coq

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Brock_Durjay_Chowdhury_2017.pdf
    Size:
    662.9Kb
    Format:
    PDF
    Download
    Author
    Chowdhury, Durjay
    Keyword
    Approximation Algorithms
    Allegory
    Coq
    
    Metadata
    Show full item record
    URI
    http://hdl.handle.net/10464/12996
    Abstract
    In this thesis, we implement several approximation algorithms for solving optimization problems on graphs. The result computed by the algorithm may or may not be optimal. The approximation factor of an algorithm indicates how close the computed result is to an optimal solution. We are going to verify two properties of each algorithm in this thesis.First, we show that the algorithm computes a solution to the problem, and, second, we show that the approximation factor is satisfied. To implement these algorithms, we use the algebraic theory of relations, i.e., the theory of allegories and various extension thereof. An implementation of various kinds of lattices and the theory of categories is required for the declaration of allegories. The programming language and interactive theorem prover Coq is used for the implementation purposes. This language is based on Higher-Order Logic (HOL) with dependent types which support both reasoning and program execution. In addition to the abstract theory, we provide the model of set-theoretic relations between finite sets. This model is executable and used in our examples. Finally, we provide an example for each of the approximation algorithm.
    Collections
    M.Sc. Computer Science

    entitlement

     
    DSpace software (copyright © 2002 - 2022)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.