Probabilistic models for the Steiner Tree problem.
- Published in:
- Networks, 2010, v. 56, n. 1, p. 39, doi. 10.1002/net.20346
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2010 AND VI 56 AND IP 1
Results: 8
1
2
Wavelength assignment in multifiber star networks.
- Published in:
- Networks, 2010, v. 56, n. 1, p. 30, doi. 10.1002/net.20345
- By:
- Publication type:
- Article
3
On the connectivity of semiregular cages.
- Published in:
- Networks, 2010, v. 56, n. 1, p. 81, doi. 10.1002/net.20349
- By:
- Publication type:
- Article
4
Complexity of some inverse shortest path lengths problems.
- Published in:
- Networks, 2010, v. 56, n. 1, p. 20, doi. 10.1002/net.20344
- By:
- Publication type:
- Article
5
Insertion heuristics for central cycle problems.
- Published in:
- Networks, 2010, v. 56, n. 1, p. 70, doi. 10.1002/net.20348
- By:
- Publication type:
- Article
6
Neighborhood conditions for graphs to be super restricted edge connected.
- Published in:
- Networks, 2010, v. 56, n. 1, p. 11, doi. 10.1002/net.20343
- By:
- Publication type:
- Article
7
Recent results on Arc Routing Problems: An annotated bibliography.
- Published in:
- Networks, 2010, v. 56, n. 1, p. 50, doi. 10.1002/net.20347
- By:
- Publication type:
- Article
8
Bounding the expected number of rectilinear full Steiner trees.
- Published in:
- Networks, 2010, v. 56, n. 1, p. 1, doi. 10.1002/net.20342
- By:
- Publication type:
- Article