Sciweavers

    117 search results - page 2 / 24
    » On the directed Full Degree Spanning Tree problem
    Sort
    View
    SAC
    2000
    ACM
    170views Applied Computing» more  SAC 2000»
    A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
    13 years 9 months ago
    A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
    Download  www.ads.tuwien.ac.at
    The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
    Günther R. Raidl, Bryant A. Julstrom
    claim paper
    Read More »
    FSTTCS
    2007
    Springer
    132views Software Engineering» more  FSTTCS 2007»
    Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
    13 years 11 months ago
    Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
    Download  www.numerik.uni-kiel.de
    In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b  2. The aim is to nd a minimum weight spannin...
    Anand Srivastav, Sören Werth
    claim paper
    Read More »
    ALGORITHMICA
    2004
    153views more  ALGORITHMICA 2004»
    Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
    13 years 4 months ago
    Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
    Download  pluto.huji.ac.il
    We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
    Jochen Könemann, Asaf Levin, Amitabh Sinha
    claim paper
    Read More »
    WEA
    2007
    Springer
    158views Algorithms» more  WEA 2007»
    A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
    13 years 11 months ago
    A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
    Download  www.mpi-inf.mpg.de
    The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
    Markus Behle, Michael Jünger, Frauke Liers
    claim paper
    Read More »
    IPPS
    2003
    IEEE
    115views Distributed And Parallel Com...» more  IPPS 2003»
    The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs
    13 years 10 months ago
    The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs
    Download  www.ibisc.univ-evry.fr
    Lélia Blin, Franck Butelle
    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.