
Journals in DBLP
Networks 2003, volume: 41, number: 2
 Ján Plesník
Towards minimum kgeodetically connected graphs. [Citation Graph (0, 0)][DBLP] Networks, 2003, v:41, n:2, pp:7382 [Journal]
 JeanClaude Bermond, Stéphan Ceroi
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. [Citation Graph (0, 0)][DBLP] Networks, 2003, v:41, n:2, pp:8386 [Journal]
 G. Brightwell, G. Oriolo, F. Bruce Shepherd
Reserving resilient capacity for a single commodity with upperbound constraints. [Citation Graph (0, 0)][DBLP] Networks, 2003, v:41, n:2, pp:8796 [Journal]
 Igor Averbakh, Oded Berman
An improved algorithm for the minmax regret median problem on a tree. [Citation Graph (0, 0)][DBLP] Networks, 2003, v:41, n:2, pp:97103 [Journal]
 Mauricio G. C. Resende, Celso C. Ribeiro
A GRASP with pathrelinking for private virtual circuit routing. [Citation Graph (0, 0)][DBLP] Networks, 2003, v:41, n:2, pp:104114 [Journal]
 J. Scott Provan
A polynomialtime algorithm to find shortest paths with recourse. [Citation Graph (0, 0)][DBLP] Networks, 2003, v:41, n:2, pp:115125 [Journal]
