Sciweavers

    31 search results - page 6 / 7
    » Solving the Minimum Label Spanning Tree Problem by Ant Colon...
    Sort
    View
    CATA
    2004
    137views Computer Science» more  CATA 2004»
    Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
    13 years 7 months ago
    Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
    Download  www.dowling.edu
    We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
    Fred J. Rispoli, Steven Cosares
    claim paper
    Read More »
    SODA
    2004
    ACM
    115views Algorithms» more  SODA 2004»
    Minimizing the stabbing number of matchings, trees, and triangulations
    13 years 7 months ago
    Minimizing the stabbing number of matchings, trees, and triangulations
    Download  www.math.tu-berlin.de
    The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
    Sándor P. Fekete, Marco E. Lübbecke, H...
    claim paper
    Read More »
    STOC
    1996
    ACM
    115views Algorithms» more  STOC 1996»
    Minimum Cuts in Near-Linear Time
    13 years 10 months ago
    Minimum Cuts in Near-Linear Time
    Download  www.cs.ust.hk
    We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
    David R. Karger
    claim paper
    Read More »

    Lecture Notes
    443views
    Design and Analysis of Computer Algorithms
    15 years 3 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 »
    CIE
    2007
    Springer
    161views Applied Computing» more  CIE 2007»
    The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
    14 years 6 days ago
    The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
    Download  www.ii.uib.no
    In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
    Michael R. Fellows, Frances A. Rosamond
    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.