Sciweavers

    80
    Voted
    NETWORKS
    1998
    62views Computer Networks» more  NETWORKS 1998»
    Fault-tolerant graphs for tori
    15 years 2 months ago
    Fault-tolerant graphs for tori
    Download  www.lab.ss.titech.ac.jp
    Toshinori Yamada, Shuichi Ueno
    claim paper
    Read More »
    79
    Voted
    NETWORKS
    1998
    62views Computer Networks» more  NETWORKS 1998»
    A polynomial algorithm for the p-centdian problem on a tree
    15 years 2 months ago
    A polynomial algorithm for the p-centdian problem on a tree
    Download  www.cs.ust.hk
    Arie Tamir, Dionisio Pérez-Brito, Jos&eacut...
    claim paper
    Read More »
    82
    Voted
    NETWORKS
    1998
    68views Computer Networks» more  NETWORKS 1998»
    A branch and cut algorithm for the Steiner problem in graphs
    15 years 2 months ago
    A branch and cut algorithm for the Steiner problem in graphs
    Download  cgm.cs.mcgill.ca
    Abilio Lucena, J. E. Beasley
    claim paper
    Read More »
    87
    Voted
    NETWORKS
    1998
    59views Computer Networks» more  NETWORKS 1998»
    Solving Steiner tree problems in graphs to optimality
    15 years 2 months ago
    Solving Steiner tree problems in graphs to optimality
    Download  www.iasi.cnr.it
    Thorsten Koch, Alexander Martin
    claim paper
    Read More »
    84
    Voted
    NETWORKS
    1998
    56views Computer Networks» more  NETWORKS 1998»
    How to test a tree
    15 years 2 months ago
    How to test a tree
    Download  www.cs.virginia.edu
    Andrew B. Kahng, Gabriel Robins, Elizabeth A. Walk...
    claim paper
    Read More »
    111
    Voted
    NETWORKS
    1998
    53views Computer Networks» more  NETWORKS 1998»
    Project scheduling with multiple modes: A comparison of exact algorithms
    15 years 2 months ago
    Project scheduling with multiple modes: A comparison of exact algorithms
    Download  www.hsba.de
    This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple exec...
    Sönke Hartmann, Andreas Drexl
    claim paper
    Read More »
    80
    Voted
    NETWORKS
    1998
    61views Computer Networks» more  NETWORKS 1998»
    A branch-and-cut algorithm for the undirected selective traveling salesman problem
    15 years 2 months ago
    A branch-and-cut algorithm for the undirected selective traveling salesman problem
    Download  web.mit.edu
    Michel Gendreau, Gilbert Laporte, Fréd&eacu...
    claim paper
    Read More »
    85
    Voted
    NETWORKS
    1998
    91views Computer Networks» more  NETWORKS 1998»
    Process network synthesis: Problem definition
    15 years 2 months ago
    Process network synthesis: Problem definition
    Download  www.dcs.vein.hu
    Ferenc Friedler, L. T. Fan, Balázs Imreh
    claim paper
    Read More »
    108
    Voted
    NETWORKS
    1998
    113views Computer Networks» more  NETWORKS 1998»
    Approximating Steiner trees in graphs with restricted weights
    15 years 2 months ago
    Approximating Steiner trees in graphs with restricted weights
    Download  www.lab.ss.titech.ac.jp
    Magnús M. Halldórsson, Shuichi Ueno,...
    claim paper
    Read More »
    91
    Voted
    NETWORKS
    1998
    49views Computer Networks» more  NETWORKS 1998»
    A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs
    15 years 2 months ago
    A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs
    Download  www.cs.kent.edu
    Andreas Brandstädt, Feodor F. Dragan
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.