Works matching IS 00283045 AND DT 2003 AND VI 41 AND IP 1

Results: 7

Upgrading trees under diameter and budget constraints.

Published in:

Networks, 2003, v. 41, n. 1, p. 24, doi. 10.1002/net.10055

By:

Chepoi, Victor;
Noltemeier, Hartmut;
Vaxès, Yann

Publication type:

Article

The SONET edge-partition problem.

Published in:

Networks, 2003, v. 41, n. 1, p. 13, doi. 10.1002/net.10054

By:

Goldschmidt, Olivier;
Hochbaum, Dorit S.;
Levin, Asaf;
Olinick, Eli V.

Publication type:

Article

Optimal rectangular partitions.

Published in:

Networks, 2003, v. 41, n. 1, p. 51, doi. 10.1002/net.10058

By:

Calheiros, Felipe C.;
Lucena, Abilio;
de Souza, Cid C.

Publication type:

Article

Social network coordination and graph routing.

Published in:

Networks, 2003, v. 41, n. 1, p. 44, doi. 10.1002/net.10057

By:

Onn, Shmuel;
Sperber, Elisheva

Publication type:

Article

Report: Some recent developments in network economics.

Published in:

Networks, 2003, v. 41, n. 1, p. 68, doi. 10.1002/net.10052

By:

Nagurney, Anna

Publication type:

Article

Toward faster algorithms for dynamic traffic assignment. I. Parametric quickest-path trees.

Published in:

Networks, 2003, v. 41, n. 1, p. 36, doi. 10.1002/net.10056

By:

Dial, Robert B.

Publication type:

Article

Multifacility ordered median problems on networks: A further analysis.

Published in:

Networks, 2003, v. 41, n. 1, p. 1, doi. 10.1002/net.10053

By:

Kalcsics, Jörg;
Nickel, Stefan;
Puerto, Justo

Publication type:

Article