Sciweavers

    632 search results - page 40 / 127
    » On the Approximability of the Steiner Tree Problem
    Sort
    View
    IPL
    2010
    65views more  IPL 2010»
    Multicasting in the hypercube, chord and binomial graphs
    13 years 7 months ago
    Multicasting in the hypercube, chord and binomial graphs
    Download  www.cs.ucsb.edu
    We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
    Christopher C. Cipriano, Teofilo F. Gonzalez
    claim paper
    Read More »
    ALGORITHMICA
    2004
    153views more  ALGORITHMICA 2004»
    Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
    13 years 8 months ago
    Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
    Download  pluto.huji.ac.il
    We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
    Jochen Könemann, Asaf Levin, Amitabh Sinha
    claim paper
    Read More »
    IPPS
    2003
    IEEE
    115views Distributed And Parallel Com...» more  IPPS 2003»
    The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs
    14 years 2 months ago
    The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs
    Download  www.ibisc.univ-evry.fr
    Lélia Blin, Franck Butelle
    claim paper
    Read More »
    ISAAC
    2001
    Springer
    99views Algorithms» more  ISAAC 2001»
    Tree-Approximations for the Weighted Cost-Distance Problem
    14 years 1 months ago
    Tree-Approximations for the Weighted Cost-Distance Problem
    Download  cone.informatik.uni-freiburg.de
    Christian Schindelhauer, Birgitta Weber
    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
    14 years 27 days 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 »
    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.