Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
16
click to vote
NETWORKS
1998
62
views
Computer Networks
»
more
NETWORKS 1998
»
Fault-tolerant graphs for tori
13 years 11 months ago
Download
www.lab.ss.titech.ac.jp
Toshinori Yamada, Shuichi Ueno
claim paper
Read More »
19
click to vote
NETWORKS
1998
62
views
Computer Networks
»
more
NETWORKS 1998
»
A polynomial algorithm for the p-centdian problem on a tree
13 years 11 months ago
Download
www.cs.ust.hk
Arie Tamir, Dionisio Pérez-Brito, Jos&eacut...
claim paper
Read More »
19
click to vote
NETWORKS
1998
68
views
Computer Networks
»
more
NETWORKS 1998
»
A branch and cut algorithm for the Steiner problem in graphs
13 years 11 months ago
Download
cgm.cs.mcgill.ca
Abilio Lucena, J. E. Beasley
claim paper
Read More »
21
click to vote
NETWORKS
1998
59
views
Computer Networks
»
more
NETWORKS 1998
»
Solving Steiner tree problems in graphs to optimality
13 years 11 months ago
Download
www.iasi.cnr.it
Thorsten Koch, Alexander Martin
claim paper
Read More »
20
click to vote
NETWORKS
1998
56
views
Computer Networks
»
more
NETWORKS 1998
»
How to test a tree
13 years 11 months ago
Download
www.cs.virginia.edu
Andrew B. Kahng, Gabriel Robins, Elizabeth A. Walk...
claim paper
Read More »
39
click to vote
NETWORKS
1998
53
views
Computer Networks
»
more
NETWORKS 1998
»
Project scheduling with multiple modes: A comparison of exact algorithms
13 years 11 months ago
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 »
20
click to vote
NETWORKS
1998
61
views
Computer Networks
»
more
NETWORKS 1998
»
A branch-and-cut algorithm for the undirected selective traveling salesman problem
13 years 11 months ago
Download
web.mit.edu
Michel Gendreau, Gilbert Laporte, Fréd&eacu...
claim paper
Read More »
22
click to vote
NETWORKS
1998
91
views
Computer Networks
»
more
NETWORKS 1998
»
Process network synthesis: Problem definition
13 years 11 months ago
Download
www.dcs.vein.hu
Ferenc Friedler, L. T. Fan, Balázs Imreh
claim paper
Read More »
27
click to vote
NETWORKS
1998
113
views
Computer Networks
»
more
NETWORKS 1998
»
Approximating Steiner trees in graphs with restricted weights
13 years 11 months ago
Download
www.lab.ss.titech.ac.jp
Magnús M. Halldórsson, Shuichi Ueno,...
claim paper
Read More »
24
click to vote
NETWORKS
1998
49
views
Computer Networks
»
more
NETWORKS 1998
»
A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs
13 years 11 months ago
Download
www.cs.kent.edu
Andreas Brandstädt, Feodor F. Dragan
claim paper
Read More »