Sciweavers

    12 search results - page 3 / 3
    » Asymptotic Clique Covering Ratios of Distance Graphs
    Sort
    View
    JDA
    2007
    129views more  JDA 2007»
    Approximating the k-traveling repairman problem with repairtimes
    13 years 6 months ago
    Approximating the k-traveling repairman problem with repairtimes
    Download  www.rajajothi.com
    Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
    Raja Jothi, Balaji Raghavachari
    claim paper
    Read More »
    PODC
    2006
    ACM
    133views Distributed And Parallel Com...» more  PODC 2006»
    Optimal-stretch name-independent compact routing in doubling metrics
    14 years 6 days ago
    Optimal-stretch name-independent compact routing in doubling metrics
    Download  www.public.asu.edu
    We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
    Goran Konjevod, Andréa W. Richa, Donglin Xi...
    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.