Local search with perturbations for the prize-collecting Steiner tree problem in graphs.
- Published in:
- Networks, 2001, v. 38, n. 1, p. 50, doi. 10.1002/net.1023
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2001 AND VI 38 AND IP 1
Results: 6
1
2
Efficient communication in unknown networks.
- Published in:
- Networks, 2001, v. 38, n. 1, p. 39, doi. 10.1002/net.1022
- By:
- Publication type:
- Article
3
An algorithm for constructing minimal c-broadcast networks.
- Published in:
- Networks, 2001, v. 38, n. 1, p. 6, doi. 10.1002/net.1019
- By:
- Publication type:
- Article
4
The ultracenter and central fringe of a graph.
- Published in:
- Networks, 2001, v. 38, n. 1, p. 33, doi. 10.1002/net.1021
- By:
- Publication type:
- Article
5
Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks.
- Published in:
- Networks, 2001, v. 38, n. 1, p. 1, doi. 10.1002/net.1018
- By:
- Publication type:
- Article
6
Electronic voting in a large-scale distributed system.
- Published in:
- Networks, 2001, v. 38, n. 1, p. 22, doi. 10.1002/net.1020
- By:
- Publication type:
- Article