Adaptive network flow with $k$-Arc Destruction

This paper examines the problems of maximum and minimum cost flow determining in networks in terms of uncertainty, in particular, the arc capacities, as well as the

Recall that our ILP algorithms are based on three models: a cut/assignment model (CAM), a label model where the representative vertices are vertices of the graph (LMR) and a label

For di↵erent datasets, Table 3 shows the real number of clusters in the dataset, the number of clusters discovered by G-means, the average distance between points and their

In this section, we prove an important estimate between the local upper bound near a fiber X y of the Riemann curvature of a particular K¨ahler-Ricci flow solution and the local

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

For bifurcated flows the results for our instances show that the k-adaptive routing scheme can provide good intermediary solution between an affine (volume) and dynamic routing.

The effect was strong enough in hydrogen to produce steady rotat- ion rates a s high a s 35 kHz for zero applied field and is the explanation of the rapid

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des