• Aucun résultat trouvé

Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations

N/A
N/A
Protected

Academic year: 2021

Partager "Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations"

Copied!
24
0
0

Texte intégral

Loading

Références

Documents relatifs

Our interest for the existence of quasi-isometrically embedded free subsemigroups comes from the following result of Bourgain [Boug]: a regular tree of degree at least three has

Les nombres super ` 0 -champions sont définis en remplaçant dans la défi- nition des nombres super `-champions la fonction ` par ` 0 , notamment dans (1.7).. Au paragraphe 2,

Note that the minimization problem can be recast as an inverse problem: given appropriate n 0 , u 0 , w 0 , what is the most likely equilibrium density operator (most likely in

[37] showed that any streaming algorithm for maximizing a monotone submodular function under a cardinality constraint with approximation ratio better than 2K K − 1 requires Ω K

All the rings considered in this paper are finite, have an identity, subrings contain the identity and ring homomorphism carry identity to identity... Corbas, for

Toute utili- sation commerciale ou impression systématique est constitutive d’une infraction pénale.. Toute copie ou impression de ce fichier doit conte- nir la présente mention

The gravitational constant (also known as the "universal gravitational constant", the "Newtonian constant of gravitation", or the "Cavendish

It is worth to mention that, there is neither an algorithm to construct a Gomory Hu tree of a symmetric submodular system by using pendant pairs nor any method to obtain pendant