Sciweavers

    459 search results - page 1 / 92
    » Approximation Algorithms for Buy-at-Bulk Geometric Network D...
    Sort
    View
    WADS
    2009
    Springer
    243views Algorithms» more  WADS 2009»
    Approximation Algorithms for Buy-at-Bulk Geometric Network Design
    13 years 11 months ago
    Approximation Algorithms for Buy-at-Bulk Geometric Network Design
    Download  www.df.lth.se
    Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
    Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, J...
    claim paper
    Read More »
    CATS
    2007
    113views Applied Computing» more  CATS 2007»
    Some Structural and Geometric Properties of Two-Connected Steiner Networks
    13 years 6 months ago
    Some Structural and Geometric Properties of Two-Connected Steiner Networks
    Download  crpit.com
    We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
    K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...
    claim paper
    Read More »
    JACM
    2007
    103views more  JACM 2007»
    Approximation via cost sharing: Simpler and better approximation algorithms for network design
    13 years 4 months ago
    Approximation via cost sharing: Simpler and better approximation algorithms for network design
    Download  theory.stanford.edu
    Anupam Gupta, Amit Kumar, Martin Pál, Tim R...
    claim paper
    Read More »

    Lecture Notes
    443views
    Design and Analysis of Computer Algorithms
    15 years 2 months ago
    Design and Analysis of Computer Algorithms
    Download  www.cs.umd.edu
    "This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
    David M. Mount
    posted by scimaster
    Read More »
    SENSYS
    2006
    ACM
    233views Sensor Networks» more  SENSYS 2006»
    Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
    13 years 10 months ago
    Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
    Download  www.cs.ucsb.edu
    We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
    Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
    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.