DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Network Design: Connectivity and Facilities Location
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By American Mathematical Society

9780821808344, 9781470439989

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Shortest networks on spheres

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Network Design: Connectivity and Facilities Location ◽

10.1090/dimacs/040/26 ◽

1998 ◽

pp. 453-461 ◽

Cited By ~ 4

Author(s):

Marcus Brazil ◽

Joachim Rubinstein ◽

D Thomas ◽

J Weng ◽

N. Wormald

Download Full-text

A scalable TWDM lightwave network based on generalized de Bruijn digraph

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Network Design: Connectivity and Facilities Location ◽

10.1090/dimacs/040/22 ◽

1998 ◽

pp. 397-414

Author(s):

Peng-Jun Wan ◽

A Pavan

Keyword(s):

De Bruijn ◽

De Bruijn Digraph

Download Full-text

A new exact algorithm for rectilinear Steiner trees

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Network Design: Connectivity and Facilities Location ◽

10.1090/dimacs/040/21 ◽

1998 ◽

pp. 357-395

Author(s):

David Warme

Keyword(s):

Exact Algorithm ◽

Steiner Trees

Download Full-text

A chunking based genetic algorithm for the Steiner tree problem in graphs

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Network Design: Connectivity and Facilities Location ◽

10.1090/dimacs/040/20 ◽

1998 ◽

pp. 335-355 ◽

Cited By ~ 8

Author(s):

Stefan Voss ◽

Kai Gutenschwager

Keyword(s):

Genetic Algorithm ◽

Steiner Tree ◽

Steiner Tree Problem

Download Full-text

A case study of de-randomization methods for combinatorial approximation algorithms

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Network Design: Connectivity and Facilities Location ◽

10.1090/dimacs/040/19 ◽

1998 ◽

pp. 319-334 ◽

Cited By ~ 1

Author(s):

Jose Rolim ◽

Luca Trevisan

Keyword(s):

Approximation Algorithms

Download Full-text

Reducing the graphical Steiner problem with a sensitivity test

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Network Design: Connectivity and Facilities Location ◽

10.1090/dimacs/040/06 ◽

1998 ◽

pp. 79-107 ◽

Cited By ~ 1

Author(s):

Cees Duin

Keyword(s):

Sensitivity Test ◽

Steiner Problem

Download Full-text

The Steiner tree problem for terminals on the boundary of a rectilinear polygon

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Network Design: Connectivity and Facilities Location ◽

10.1090/dimacs/040/04 ◽

1998 ◽

pp. 39-57 ◽

Cited By ~ 2

Author(s):

Siu-Wing Cheng

Keyword(s):

Steiner Tree ◽

Steiner Tree Problem ◽

Rectilinear Polygon

Download Full-text

A generalized threshold algorithm for the shortest path problem with time windows

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Network Design: Connectivity and Facilities Location ◽

10.1090/dimacs/040/18 ◽

1998 ◽

pp. 303-318 ◽

Cited By ~ 10

Author(s):

Warren Powell ◽

Zhi-Long Chen

Keyword(s):

Shortest Path ◽

Time Windows ◽

Shortest Path Problem ◽

Threshold Algorithm

Download Full-text

Connected facility location problems

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Network Design: Connectivity and Facilities Location ◽

10.1090/dimacs/040/12 ◽

1998 ◽

pp. 179-190 ◽

Cited By ~ 2

Author(s):

Sudipto Guha ◽

Samir Khuller

Keyword(s):

Facility Location ◽

Location Problems ◽

Facility Location Problems ◽

Connected Facility Location

Download Full-text

A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Network Design: Connectivity and Facilities Location ◽

10.1090/dimacs/040/09 ◽

1998 ◽

pp. 131-142 ◽

Cited By ~ 4

Author(s):

Kristina Holmqvist ◽

Athanasios Migdalas ◽

Panos Pardalos

Keyword(s):

Network Flow ◽

Flow Problem ◽

Single Source ◽

Network Flow Problem ◽

Concave Cost

Download Full-text

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Network Design: Connectivity and Facilities LocationLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By American Mathematical Society

Shortest networks on spheres

A scalable TWDM lightwave network based on generalized de Bruijn digraph

A new exact algorithm for rectilinear Steiner trees

A chunking based genetic algorithm for the Steiner tree problem in graphs

A case study of de-randomization methods for combinatorial approximation algorithms

Reducing the graphical Steiner problem with a sensitivity test

The Steiner tree problem for terminals on the boundary of a rectilinear polygon

A generalized threshold algorithm for the shortest path problem with time windows

Connected facility location problems

A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Network Design: Connectivity and Facilities Location
Latest Publications