Name
Abstract | ||
|---|---|---|
The survivable network design problems(SNDP) are to find a set of edges that satisfies network constraints that consist of the number of node(edge)-disjoint paths for each given pair of nodes. This kind of problems are found in designing optic fiber network topology in modern telecommunications, in this paper, we consider the survivable network; design problems with given conduits. We propose 2 modifications of a local search method[6] and compare the efficiency Of the proposed methods through computational experiments. |
Year | Venue | Keywords |
|---|---|---|
2000 | IC'2000: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INTERNET COMPUTING | network,survivability,telecommunication,heuristic |
Field | DocType | Citations |
Network planning and design,Computer science,Heuristics,Distributed computing | Conference | 0 |
PageRank | References | Authors |
0.34 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chi-Geun Han | 1 | 82 | 7.30 |
| Taeju Lee | 2 | 4 | 1.46 |