1 resultado para stochastic linear programming

em Cochin University of Science


Relevância:

80.00% 80.00%

Publicador:

Resumo:

The set of vertices that maximize (minimize) the remoteness is the antimedian (median) set of the profile. It is proved that for an arbitrary graph G and S V (G) it can be decided in polynomial time whether S is the antimedian set of some profile. Graphs in which every antimedian set is connected are also considered.