Sciweavers

    105 search results - page 2 / 21
    » A 3-Approximation for the Minimum Tree Spanning k Vertices
    Sort
    View
    IWPEC
    2009
    Springer
    134views Applied Computing» more  IWPEC 2009»
    On the Directed Degree-Preserving Spanning Tree Problem
    14 years 2 months ago
    On the Directed Degree-Preserving Spanning Tree Problem
    Download  faculty.cs.tamu.edu
    In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
    Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
    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
    13 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 »
    NETWORKS
    2010
    148views Computer Networks» more  NETWORKS 2010»
    Fixed-parameter tractability results for full-degree spanning tree and its dual
    13 years 6 months ago
    Fixed-parameter tractability results for full-degree spanning tree and its dual
    Download  theinf1.informatik.uni-jena.de
    We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
    Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
    claim paper
    Read More »
    CORR
    2008
    Springer
    138views Education» more  CORR 2008»
    Computing Minimum Spanning Trees with Uncertainty
    13 years 7 months ago
    Computing Minimum Spanning Trees with Uncertainty
    Download  drops.dagstuhl.de
    Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
    Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
    claim paper
    Read More »
    COMPGEOM
    2003
    ACM
    108views Discrete Geometry» more  COMPGEOM 2003»
    Euclidean bounded-degree spanning tree ratios
    14 years 27 days ago
    Euclidean bounded-degree spanning tree ratios
    Download  www.cs.uwaterloo.ca
    Let τK be the worst-case (supremum) ratio of the weight of the minimum degree-K spanning tree to the weight of the minimum spanning tree, over all finite point sets in the Eu
    Timothy M. Chan
    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.