Sciweavers

    1161 search results - page 6 / 233
    » Approximation schemes for clustering problems
    Sort
    View
    STACS
    2009
    Springer
    152views Theoretical Computer Science» more  STACS 2009»
    Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
    15 years 6 months ago
    Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
    Download  drops.dagstuhl.de
    We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
    Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
    claim paper
    Read More »
    STOC
    1995
    ACM
    145views Algorithms» more  STOC 1995»
    Polynomial time approximation schemes for dense instances of NP-hard problems
    15 years 3 months ago
    Polynomial time approximation schemes for dense instances of NP-hard problems
    Download  www.cs.tau.ac.il
    We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
    Sanjeev Arora, David R. Karger, Marek Karpinski
    claim paper
    Read More »
    87
    Voted
    STOC
    2005
    ACM
    111views Algorithms» more  STOC 2005»
    Tensor decomposition and approximation schemes for constraint satisfaction problems
    16 years 1 days ago
    Tensor decomposition and approximation schemes for constraint satisfaction problems
    Download  www-math.mit.edu
    Wenceslas Fernandez de la Vega, Marek Karpinski, R...
    claim paper
    Read More »
    LICS
    2006
    IEEE
    62views Automated Reasoning» more  LICS 2006»
    Approximation Schemes for First-Order Definable Optimisation Problems
    15 years 5 months ago
    Approximation Schemes for First-Order Definable Optimisation Problems
    Download  www.newton.ac.uk
    Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole...
    claim paper
    Read More »
    ICALP
    2003
    Springer
    101views Programming Languages» more  ICALP 2003»
    Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem
    15 years 5 months ago
    Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem
    Download  publications.ias.edu
    Sanjeev Arora, Kevin L. Chang
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2025, USA.