Sciweavers

    4894 search results - page 56 / 979
    » The Guarding Problem - Complexity and Approximation
    Sort
    View
    CPM
    1997
    Springer
    111views Combinatorics» more  CPM 1997»
    Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem
    15 years 11 months ago
    Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem
    Download  www.csc.liv.ac.uk
    Mary Cryan, Leslie Ann Goldberg, Cynthia A. Philli...
    claim paper
    Read More »
    ISAAC
    1993
    Springer
    106views Algorithms» more  ISAAC 1993»
    Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
    15 years 11 months ago
    Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
    Download  www.cs.gsu.edu
    Ulrich Fößmeier, Michael Kaufmann, Alex...
    claim paper
    Read More »
    STOC
    1994
    ACM
    97views Algorithms» more  STOC 1994»
    An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
    15 years 11 months ago
    An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
    Download  www.cs.uwaterloo.ca
    Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
    Naveen Garg, Dorit S. Hochbaum
    claim paper
    Read More »
    148
    Voted
    STOC
    1989
    ACM
    66views Algorithms» more  STOC 1989»
    The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
    15 years 11 months ago
    The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
    Download  users.soe.ucsc.edu
    Leonard Pitt, Manfred K. Warmuth
    claim paper
    Read More »
    186
    Voted
    APPROX
    2006
    Springer
    126views Algorithms» more  APPROX 2006»
    Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
    15 years 11 months ago
    Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
    Download  www.openu.ac.il
    Zeev Nutov
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.