[PDF] Top 20 On the hitting set of bundles problem
Has 10000 "On the hitting set of bundles problem" found on our website. Below are the top 20 most common "On the hitting set of bundles problem".
On the hitting set of bundles problem
... different bundles is not taken into ...on the one that was originally used for the SET CO - VER problem [11] (using the effective cost of the subsets) does not ... Voir le document complet
15
Practical and efficient algorithms for the geometric hitting set problem
... geometric hitting set problem is one of the basic geometric combinatorial opti- mization problems: given a set P of points and a set D of geometric objects ... Voir le document complet
14
On the Minimum Hitting Set of Bundles Problem
... for the mhsb problem, where N is the maximum number of bundles per set and M is the max- imum number of sets an element can appear ...in the area of ... Voir le document complet
14
Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set
... part of the original 21 NP-complete problems posed by Richard Karp ...However, the numerous applications for these problems inspired researchers to design algorithms to find solutions with reasonable ... Voir le document complet
15
Improved worst-case complexity for the MIN 3-SET COVERING problem
... k hitting S j on element u i are excluded from S 0 , or all subsets S k hitting S j on elements u p and u q are excluded from S 0 ...by the same kind of analysis. Assume, without loss ... Voir le document complet
7
Constructive-non-constructive approximation and maximum independent set problem
... (i) The condition f + g ≤ κ implies that both f and g are bounded above by ...H of matching edges and for all k-tuple K of exposed vertices of V with respect to M , we form the ... Voir le document complet
20
A priori optimization for the probabilistic maximum independent set problem
... kind of problems any feasible solution is a onne ted subgraph of the input-graph and sin e this latter graph is supposed omplete, there always exist a proper (and easy) ... Voir le document complet
26
View planning as a set covering problem
... by the viewpoint generation stage. The optimal X is the minimal set of viewpoints covering S - that is, the next-best-view set N .... The constraints de ned by ... Voir le document complet
5
Sectional algebras of semigroupoid bundles
... study of topologies on spaces of functions is a classical problem of elementary topology, and is mo- tivated by the question of exponentiability of a topological space X: ... Voir le document complet
32
Set-Membership Approach to the Kidnapped Robot Problem
... DEM, the space can be split into two sets: the one over the surface (z −f(x, y) > 0) and the one below (z − f(x, y) < ...and the classical GOMNE approach can be used to cope with ... Voir le document complet
7
The Max Quasi-Independent Set Problem
... remainder of the paper is organized as ...to the optimal solutions for ...for the three variants of max quasi-independent set and proves its NP- hardness in bipartite ...for ... Voir le document complet
21
The max quasi-independent set problem
... with the problem of finding quasi-independent sets in ...This problem is formally defined in three versions, which are shown to be polynomially ...equivalent. The one that looks most ... Voir le document complet
16
A note on the Clustered Set Covering Problem
... knowledge, the MCRP has never been studied before. If the fixed cost f is equal to zero, then the problem is trivial since it suffices to select index j with minimum ratio c j / P i∈I a ij , ... Voir le document complet
9
On the rate boundary value problem for damage modelization by thick level-set
... Studying the properties of the operator F give conditions on stability and uniqueness of velocity a(s) as proposed in ...that the presence of a and da/ds in the functional ... Voir le document complet
12
Improved Local Search for Geometric Hitting Set
... have the same limitation: local search is able to give a PTAS, but with hopeless running times; ...for the geometric hitting takes more than n 66 time [15] for the geometric hitting ... Voir le document complet
17
CONFORMAL SYMPLECTIC GEOMETRY OF COTANGENT BUNDLES
... in the symplectic case, the Moser theorem for conformal symplectic structures is used to prove a Weinstein neighborhood theorem for Lagrangians in conformal symplectic manifolds, showing that Example ... Voir le document complet
15
ON THE STABILITY OF FLAT COMPLEX VECTOR BUNDLES OVER PARALLELIZABLE MANIFOLDS
... Γ, of ho- momorphisms ρ : Γ −→ SL(2, C) that are close to the map of Γ to the identity element (the trivial ...as the first Betti number of Γ is positive, there exists ... Voir le document complet
11
Solving Stefan problem through C-NEM and level-set approach
... Stefan problem through C-NEM and level-set approach Coupling C-Nem with a level-set approach Enrichment function ψ Here we have chosen a enrichment function, proposed by Moes et al 1 , in order ... Voir le document complet
33
On the hitting times of continuous-state branching processes with immigration.
... , the process is transient, otherwise the process is ...and the process is recurrent (we refer to Chapter XI of Revuz-Yor [ 24 ] for a ...for the general CBI processes. The ... Voir le document complet
19
Cohomology of GKM fiber bundles
... consisting of classes that are W ...from the equivariant Schubert classes by averaging over the action of the Weyl ...for the decomposition of twisted Schubert classes, ... Voir le document complet
36
Sujets connexes