Sciweavers

    ALGORITHMICA
    2004
    153views more  ALGORITHMICA 2004»
    Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
    14 years 6 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 »
    FAW
    2010
    Springer
    225views Algorithms» more  FAW 2010»
    Computing Minimum Diameter Color-Spanning Sets
    14 years 6 months ago
    Computing Minimum Diameter Color-Spanning Sets
    Download  www.tcs.fudan.edu.cn
    We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
    Rudolf Fleischer, Xiaoming Xu
    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.