• Aucun résultat trouvé

[PDF] Top 20 Polynomial approximation and graph-coloring

Has 10000 "Polynomial approximation and graph-coloring" found on our website. Below are the top 20 most common "Polynomial approximation and graph-coloring".

Polynomial approximation and graph-coloring

Polynomial approximation and graph-coloring

... olor and removes all of them from the input graph; next she/he transforms the surviving graph into an instan e of k SC as we have seen in se tion 13 and approximately solves k SC in this ... Voir le document complet

41

Weighted coloring on planar, bipartite and split graphs: complexity and approximation

Weighted coloring on planar, bipartite and split graphs: complexity and approximation

... split graph if K 1 is a clique of G with size |K 1 | = n 1 and V 2 is an independent set with size |V 2 | = n 2 ...split graph can be viewed as a bipartite graph where the left set is a ... Voir le document complet

25

Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem

Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem

... ), and the re- ceiver wishes to compute a deterministic function of sources ...X1 and G X2 (or, similarly the minimum entropy colorings of G n X 1 and G n X 2 , for some ...arbitrary graph, ... Voir le document complet

6

Online graph coloring with bichromatic exchanges

Online graph coloring with bichromatic exchanges

... constant approximation ratio exists for other classes of graphs ...NB08] and disk intersection graphs [CFKP07, EF02, ...the approximation ratio of greedy algorithms is quite large even for some ... Voir le document complet

16

Decomposition, approximation, and coloring of odd-minor-free graphs

Decomposition, approximation, and coloring of odd-minor-free graphs

... H, and show how these theorems can be used to obtain approximation algorithms for several algorithmic problems in such ...from Graph Minor The- ory, and on the other hand providing an ... Voir le document complet

17

On a generalized graph coloring/batch scheduling problem

On a generalized graph coloring/batch scheduling problem

... Scheduling-Edge Coloring (BS-EC) ...NP-hard and 7/6-inapproximable even for cubic planar bipartite graphs and edge weights restricted to be 1, 2 or 3 [6, ... Voir le document complet

8

Formal Verification of Coalescing Graph-Coloring Register Allocation

Formal Verification of Coalescing Graph-Coloring Register Allocation

... on polynomial graph problems and their algo- ...positive-weighted graph. In 1998, Paulin and Filliˆ atre proved Floyd’s algorithm using Coq and a tool for verifying imperative ... Voir le document complet

21

Approximation of MIN COLORING by moderately exponential algorithms

Approximation of MIN COLORING by moderately exponential algorithms

... devise approximation algorithms for min coloring achieving approxi- mation ratios “forbidden” in polynomial time, for both the standard and the differential approx- imation ...time and ... Voir le document complet

11

Improved Approximation Algorithms for the Max-Edge Coloring Problem

Improved Approximation Algorithms for the Max-Edge Coloring Problem

... 2- approximation algorithm for general graphs has been proposed in ...2 approximation ratio have been also ...input graph increases. In [2] has been also presented a 3/2-approximation ... Voir le document complet

12

Probabilistic graph-coloring in bipartite and split graphs

Probabilistic graph-coloring in bipartite and split graphs

... minimum graph-coloring introduced in ...Murat and V. Th. Paschos, On the probabilistic minimum coloring and minimum k-coloring, Discrete Applied Mathematics 154, 2006), ... Voir le document complet

34

A note on the approximation ratio of graph-coloring

A note on the approximation ratio of graph-coloring

... in polynomial time algorithms providing, for all instan es, feasible solutions the values of whi h are as lose as possible to the value of the optimal ...alled polynomial time approximation ... Voir le document complet

4

Constraint and Satisfiability Reasoning for Graph Coloring

Constraint and Satisfiability Reasoning for Graph Coloring

... branch and bound algorithms, however, is that the standard lower bound, which is the size of a maximal (not necessarily maximum) clique, is computed only once at the root of the search ...the coloring, but ... Voir le document complet

34

Strategic Coloring of a Graph

Strategic Coloring of a Graph

... Panagopoulou and Spirakis [15] introduced the game and studied its set of pure strategy Nash equilibria, denoted by P N ...sustainable and rational states of the ...every graph G and ... Voir le document complet

25

Selective Graph Coloring in Some Special Classes of Graphs

Selective Graph Coloring in Some Special Classes of Graphs

... a graph G = (V, E) with stability number at most ...clique and hence has stability number exactly ...is polynomial-time solvable (see for instance ...iliary graph H = (V H , E H ): with every ... Voir le document complet

12

Sparse polynomial approximation of parametric elliptic PDEs Part I: affine coefficients

Sparse polynomial approximation of parametric elliptic PDEs Part I: affine coefficients

... 5.1 Parametrization by disjoint inclusions In our first test, we choose a family {D j } j≥1 of disjoint open intervals in D and a β > 0, and define ψ j := θj −β χ D j . (85) Note that although this does ... Voir le document complet

22

Register allocation by graph coloring under full live-range splitting

Register allocation by graph coloring under full live-range splitting

... Grund and Hack conclude in [16] that their cutting-plane al- gorithm fails when applied to the largest graphs of the ...coalescing and provide a strategy for reducing interference graphs before ...strategy ... Voir le document complet

11

Towards a general formal framework for polynomial approximation

Towards a general formal framework for polynomial approximation

... max_IS and O(log n=(n log log n)) for max_WIS (see theorem 3 of se tion ...unweighted and weighted max_IS are not (at the urrent state of knowledge) of the same hardness regarding their approximability ... Voir le document complet

41

List coloring digraphs

List coloring digraphs

... A and remove x from all ...bipartite graph G with bipartition (R, C) in which there is an edge between a vertex r ∈ R and a vertex c ∈ C if and only if c belongs to the color list of r after ... Voir le document complet

19

An overview on polynomial approximation of NP-hard problems

An overview on polynomial approximation of NP-hard problems

... of approximation algorithms guaranteeing “good” approximation ratios and the achieve- ment of inapproximability ...specific approximation algorithm for Π is fine or not but, informally, if the ... Voir le document complet

35

Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues

Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues

... In these settings, the design of survivable networks is more challenging than ever. Shared Risk Resource Group (SRG) has been introduced to capture the concept of a set of resources that would fail down simultaneously in ... Voir le document complet

18

Show all 10000 documents...