Sciweavers

    1671 search results - page 6 / 335
    » On the Covering Steiner Problem
    Sort
    View
    MFCS
    2001
    Springer
    130views Theoretical Computer Science» more  MFCS 2001»
    On the Approximability of the Steiner Tree Problem
    14 years 2 months ago
    On the Approximability of the Steiner Tree Problem
    Download  www.matheon.de
    We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
    Martin Thimm
    claim paper
    Read More »
    TCBB
    2010
    166views more  TCBB 2010»
    Approximate Maximum Parsimony and Ancestral Maximum Likelihood
    13 years 8 months ago
    Approximate Maximum Parsimony and Ancestral Maximum Likelihood
    Download  www.cs.tau.ac.il
    — We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
    Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport
    claim paper
    Read More »
    ALGORITHMICA
    2005
    99views more  ALGORITHMICA 2005»
    Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
    13 years 9 months ago
    Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
    Download  www.cs.gsu.edu
    Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
    Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
    claim paper
    Read More »
    STOC
    2004
    ACM
    118views Algorithms» more  STOC 2004»
    Boosted sampling: approximation algorithms for stochastic optimization
    14 years 10 months ago
    Boosted sampling: approximation algorithms for stochastic optimization
    Download  www.aladdin.cs.cmu.edu
    Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
    Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
    claim paper
    Read More »
    STOC
    2005
    ACM
    89views Algorithms» more  STOC 2005»
    Universal approximations for TSP, Steiner tree, and set cover
    14 years 10 months ago
    Universal approximations for TSP, Steiner tree, and set cover
    Download  www.ccs.neu.edu
    Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan R...
    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-2024, USA.