Sciweavers

    1941 search results - page 22 / 389
    » On Generalizations of Network Design Problems with Degree Bo...
    Sort
    View
    ESA
    2004
    Springer
    126views Algorithms» more  ESA 2004»
    Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
    14 years 23 days ago
    Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
    Download  www.cs.rpi.edu
    We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
    Elliot Anshelevich, Lisa Zhang
    claim paper
    Read More »
    MP
    1998
    109views more  MP 1998»
    Rounding algorithms for covering problems
    13 years 7 months ago
    Rounding algorithms for covering problems
    Download  web.mit.edu
    In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
    Dimitris Bertsimas, Rakesh V. Vohra
    claim paper
    Read More »
    PODC
    2009
    ACM
    152views Distributed and Parallel Com...» more  PODC 2009»
    Bounding the locality of distributed routing algorithms
    14 years 8 months ago
    Bounding the locality of distributed routing algorithms
    Download  www.cs.umanitoba.ca
    d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
    Prosenjit Bose, Paz Carmi, Stephane Durocher
    claim paper
    Read More »
    TIT
    2008
    119views more  TIT 2008»
    Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
    13 years 7 months ago
    Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
    Download  www.seas.upenn.edu
    We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
    Prasanna Chaporkar, Koushik Kar, Xiang Luo, Saswat...
    claim paper
    Read More »
    STOC
    2003
    ACM
    130views Algorithms» more  STOC 2003»
    A tight bound on approximating arbitrary metrics by tree metrics
    14 years 7 months ago
    A tight bound on approximating arbitrary metrics by tree metrics
    Download  kam.mff.cuni.cz
    In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
    Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
    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.