[PDF] Top 20 Constructive-non-constructive approximation and maximum independent set problem
Has 10000 "Constructive-non-constructive approximation and maximum independent set problem" found on our website. Below are the top 20 most common "Constructive-non-constructive approximation and maximum independent set problem".
Constructive-non-constructive approximation and maximum independent set problem
... maximum independent set problem ...polynomial approximation theory, developed as the main tool for efficiently solving NP-complete problems, can moti- vate a great number of questions ... Voir le document complet
20
The complexity of the exact weighted independent set problem
... weighted independent set problem ...optimization problem, such as minimum spanning tree, maximum cut in planar graphs, minimum weight perfect matching, or maxi- mum weight ... Voir le document complet
41
The max quasi-independent set problem
... ) and finally T(G d ) = 2 dn/(d+1) On the other hand, α(G d ) = n/(d + 1) (one vertex per ...no problem is polynomial on graphs of average degree bounded above by some d > 0, unless it belongs to P (just ... Voir le document complet
16
The Max Quasi-Independent Set Problem
... same problem as γ-QIS is addressed, formulated as the research, given a graph and 0 ≤ γ ≤ 1, of a maximum subgraph of sparsity (defined as the ratio of the number of its edges over the number of ... Voir le document complet
21
Maximum-weight independent set is as "well" approximated as the unweighted one
... an independent set of size w u in G w and every edge of E orresponds to a omplete bipartite graph in G w ...every independent set S of G of total weight w(S) indu es, in G w , the ... Voir le document complet
22
A 2-approximation for the maximum satisfying bisection problem
... partition problem have been ...vertex set of a given graph can be partitioned into two nonempty sets such that each vertex has at least as many neighbors in the set it does not belong to as in its ... Voir le document complet
7
Robust maximum weighted independent-set problems on interval graphs
... graphs; independent set; dynamic ...a maximum weighted independent-set problem (MWIS) where a weight is assigned to each vertex of the interval graph [8, 11, ...approximatively ... Voir le document complet
7
The Robust Set Problem: Parameterized Complexity and Approximation
... W[1] and there is a good reason to believe that W[1]-hard problems are unlikely to be fixed-parameter ...A problem in W[i] is considered harder than those in W[i − 1] where i > ...satisfiability ... Voir le document complet
12
Efficient Independent Set Approximation in Unit Disk Graphs *
... time, and query time disappear if the respective complexities are Ω(n 1+ε ), Ω(n 1+ε ), and Ω(n ε ...half-space maximum queries. This is possible because the set of generators depends on the ... Voir le document complet
13
3D Shape Optimization with X-FEM and a Level Set Constructive Geometry Approach
... this problem is obtained using the so-called sequential convex programming ...analysis problem is solved and a sensitivity analysis is ...optimization problem is then found by using a CONvex ... Voir le document complet
10
A priori optimization for the probabilistic maximum independent set problem
... is not omputable in polynomial time (if this was true, it would be a very interesting result sin e, in this ase, PIS2 and PIS3 would not belong to NP). In fa t, the result of theorem 6 is based upon a parti ular ... Voir le document complet
26
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs
... Keywords: Independent set; Polynomial-time algorithm; Subcubic graph 1 Introduction In a graph, an independent set is a subset of vertices no two of which are adja- ...The maximum ... Voir le document complet
13
Constructive Ambiguity : Comparing the EU's Energy and Defence Policies
... transversal and comprehensive authority by linking climate change and security of supply within a single ...security and defense ...preferences and strategic ...ambiguity and ... Voir le document complet
30
Constructive formulations of resonant Maxwell's equations
... subsequence and may not be ...(23), and there the answer is known to be ...well-posed, and that is amenable to numerical ...(17) and the uniform L 2 bound (19), one has for 0 < ε < ... Voir le document complet
38
The 0-1 inverse maximum stable set problem
... Greedy and 2opt are both very natural and practical for approxi- mating maximum stable ...degree and removes it from the graph together with all of its ...stable set S, ...stable ... Voir le document complet
17
Constructive synthesis of optimized cryptographic primitives
... integer), and wraps it as an ...mistake, and added quite a lot of complexity: it would have been far easier to simply reify into differently typed syntax ... Voir le document complet
65
Constructive global analysis of hybrid systems
... The success and power of this new methodology were well demonstrated in globally analyzing equilibrium points and limit cycles of several classes of piecewise linear syste[r] ... Voir le document complet
149
A constructive and unifying framework for zero-bit watermarking
... Index Terms Zero-bit watermarking, Pitman-Noether theorem, detection theory. I. I NTRODUCTION In the past six years, side-informed embedding strategies have been shown to greatly improve watermark decoding. They exploit ... Voir le document complet
28
An introduction to constructive algebraic analysis and its applications
... one independent variable, arbitrary functions of two independent variables, ...]) and further developed by Hadamard ([ 39 ]), Hilbert, Cartan, ...Monge problem was extended to the case of ... Voir le document complet
245
Constructive Spherical Codes near the Shannon Bound
... While the size of the large prime in Theorem 8 might seem outlandish, we believe that our constructions of spherical codes might have some practical interest for more realistic inner codes. We observe that the complexity ... Voir le document complet
11
Sujets connexes