Sciweavers

    4843 search results - page 39 / 969
    » The Shortcut Problem - Complexity and Approximation
    Sort
    View
    STOC
    2007
    ACM
    154views Algorithms» more  STOC 2007»
    Improved approximation for directed cut problems
    14 years 9 months ago
    Improved approximation for directed cut problems
    Download  www.math.tau.ac.il
    Amit Agarwal, Noga Alon, Moses Charikar
    claim paper
    Read More »
    STOC
    2003
    ACM
    114views Algorithms» more  STOC 2003»
    Approximation algorithms for hierarchical location problems
    14 years 9 months ago
    Approximation algorithms for hierarchical location problems
    Download  www.cs.utexas.edu
    C. Greg Plaxton
    claim paper
    Read More »
    APPROX
    2009
    Springer
    145views Algorithms» more  APPROX 2009»
    Approximating Some Network Design Problems with Node Costs
    14 years 3 months ago
    Approximating Some Network Design Problems with Node Costs
    Download  crab.rutgers.edu
    We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
    Guy Kortsarz, Zeev Nutov
    claim paper
    Read More »
    ALGORITHMICA
    2005
    99views more  ALGORITHMICA 2005»
    Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
    13 years 8 months ago
    Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
    Download  www.cs.gsu.edu
    Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
    Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
    claim paper
    Read More »
    EOR
    2006
    120views more  EOR 2006»
    Approximate and exact algorithms for the fixed-charge knapsack problem
    13 years 8 months ago
    Approximate and exact algorithms for the fixed-charge knapsack problem
    Download  www.math.tu-dresden.de
    The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
    Umit Akinc
    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.