Sciweavers

    1331 search results - page 6 / 267
    » Complexity bounds for zero-test algorithms
    Sort
    View
    EOR
    2008
    136views more  EOR 2008»
    Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
    13 years 7 months ago
    Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
    Download  theinf1.informatik.uni-jena.de
    Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
    Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
    claim paper
    Read More »
    JSAC
    2006
    157views more  JSAC 2006»
    Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
    13 years 7 months ago
    Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
    Download  www-sop.inria.fr
    We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
    Shu Huang, Rudra Dutta, George N. Rouskas
    claim paper
    Read More »
    SODA
    2010
    ACM
    178views Algorithms» more  SODA 2010»
    Basis Reduction, and the Complexity of Branch-and-Bound
    14 years 5 months ago
    Basis Reduction, and the Complexity of Branch-and-Bound
    Download  www.unc.edu
    Gabor Pataki, Mustafa Tural
    claim paper
    Read More »
    COCO
    1990
    Springer
    84views Algorithms» more  COCO 1990»
    Some Connections Between Bounded Query Classes and Non-Uniform Complexity
    13 years 11 months ago
    Some Connections Between Bounded Query Classes and Non-Uniform Complexity
    Download  www.cs.umd.edu
    Amihood Amir, Richard Beigel, William I. Gasarch
    claim paper
    Read More »
    COCO
    1995
    Springer
    85views Algorithms» more  COCO 1995»
    On Superlinear Lower Bounds in Complexity Theory
    13 years 11 months ago
    On Superlinear Lower Bounds in Complexity Theory
    Download  www.cse.buffalo.edu
    Kenneth W. Regan
    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.