Works matching IS 00283045 AND DT 2021 AND VI 77 AND IP 3

Results: 9

Efficient algorithms for finding 2‐medians of a tree.

Published in:

Networks, 2021, v. 77, n. 3, p. 383, doi. 10.1002/net.21978

By:

Oudjit, Aissa;
Stallmann, Matthias F.

Publication type:

Article

A story of diameter, radius, and (almost) Helly property.

Published in:

Networks, 2021, v. 77, n. 3, p. 435, doi. 10.1002/net.21998

By:

Ducoffe, Guillaume;
Dragan, Feodor F.

Publication type:

Article

A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits.

Published in:

Networks, 2021, v. 77, n. 3, p. 421, doi. 10.1002/net.21994

By:

Omer, Jérémy;
Poss, Michael

Publication type:

Article

Parameter estimation in a 3‐parameter p‐star random graph model.

Published in:

Networks, 2021, v. 77, n. 3, p. 403, doi. 10.1002/net.21992

By:

Lenarda, Pietro;
Gnecco, Giorgio;
Riccaboni, Massimo

Publication type:

Article

Packing returning secretaries.

Published in:

Networks, 2021, v. 77, n. 3, p. 454, doi. 10.1002/net.22000

By:

Hoefer, Martin;
Wilhelmi, Lisa

Publication type:

Article

The firebreak problem.

Published in:

Networks, 2021, v. 77, n. 3, p. 372, doi. 10.1002/net.21975

By:

Barnetson, Kathleen D.;
Burgess, Andrea C.;
Enright, Jessica;
Howell, Jared;
Pike, David A.;
Ryan, Brady

Publication type:

Article

Fixed interval scheduling with third‐party machines.

Published in:

Networks, 2021, v. 77, n. 3, p. 361, doi. 10.1002/net.21973

By:

Fridman, Ilia;
Kovalyov, Mikhail Y.;
Pesch, Erwin;
Ryzhikov, Andrew

Publication type:

Article

Retracted: A novel pseudo‐polynomial approach for shortest paths problems.

Published in:: Networks, 2021, v. 77, n. 3, p. 472, doi. 10.1002/net.21966
Publication type:: Article

Issue Information.

Published in:: Networks, 2021, v. 77, n. 3, p. 359, doi. 10.1002/net.21952
Publication type:: Article