Approximation algorithm

Results: 454



#Item
1Approximation algorithms An algorithm has approximation ratio r if it outputs solutions with cost such that c/c* ≤ r and c*/c ≤ r where c* is the optimal cost.

Approximation algorithms An algorithm has approximation ratio r if it outputs solutions with cost such that c/c* ≤ r and c*/c ≤ r where c* is the optimal cost.

Add to Reading List

Source URL: www.ccs.neu.edu

Language: English - Date: 2015-08-12 09:01:08
    2A Quadratically Convergent Algorithm for Structured Low-Rank Approximation ´ Eric Schost1 and Pierre-Jean Spaenlehauer2 1

    A Quadratically Convergent Algorithm for Structured Low-Rank Approximation ´ Eric Schost1 and Pierre-Jean Spaenlehauer2 1

    Add to Reading List

    Source URL: cs.uwaterloo.ca

    Language: English - Date: 2015-10-14 23:46:10
      3A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem (Extended Abstract) Ola Svensson* Jakub Tarnawski†

      A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem (Extended Abstract) Ola Svensson* Jakub Tarnawski†

      Add to Reading List

      Source URL: theory.epfl.ch

      Language: English - Date: 2017-11-06 12:41:04
        4Approximating the Diameter of Planar Graphs in Near Linear Time OREN WEIMANN and RAPHAEL YUSTER, University of Haifa We present a (1 + ε)-approximation algorithm running in O( f (ε) · n log4 n) time for finding the di

        Approximating the Diameter of Planar Graphs in Near Linear Time OREN WEIMANN and RAPHAEL YUSTER, University of Haifa We present a (1 + ε)-approximation algorithm running in O( f (ε) · n log4 n) time for finding the di

        Add to Reading List

        Source URL: www.cs.haifa.ac.il

        Language: English - Date: 2016-03-09 08:46:36
          5A 1.8 Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2 GUY EVEN Tel-Aviv University JON FELDMAN Google, NY

          A 1.8 Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2 GUY EVEN Tel-Aviv University JON FELDMAN Google, NY

          Add to Reading List

          Source URL: crab.rutgers.edu

          Language: English - Date: 2008-11-20 13:29:33
            6An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation David Anderson * 1 Ming Gu * 1 Abstract

            An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation David Anderson * 1 Ming Gu * 1 Abstract

            Add to Reading List

            Source URL: proceedings.mlr.press

            - Date: 2018-02-06 15:06:57
              7Approximation Algorithm for the Kinetic Robust K-Center Problem Sorelle A. Friedlera,∗,1 , David M. Mounta,2 a Department of Computer Science

              Approximation Algorithm for the Kinetic Robust K-Center Problem Sorelle A. Friedlera,∗,1 , David M. Mounta,2 a Department of Computer Science

              Add to Reading List

              Source URL: sorelle.friedler.net

              - Date: 2016-04-17 13:12:00
                8princeton univ. F’14 cos 521: Advanced Algorithm Design Lecture 7: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

                princeton univ. F’14 cos 521: Advanced Algorithm Design Lecture 7: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

                Add to Reading List

                Source URL: www.cs.princeton.edu

                - Date: 2014-10-14 20:29:59
                  9Poster Paper An On-Line Approximation Algorithm for Mining Frequent Closed Itemsets Based on Incremental Intersection Koji Iwanuma

                  Poster Paper An On-Line Approximation Algorithm for Mining Frequent Closed Itemsets Based on Incremental Intersection Koji Iwanuma

                  Add to Reading List

                  Source URL: openproceedings.org

                  - Date: 2016-04-12 08:50:29
                    10An O(k3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design

                    An O(k3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design

                    Add to Reading List

                    Source URL: theoryofcomputing.org

                    - Date: 2014-11-14 13:01:31