3875 search results - page 109 / 775 » Approximation Algorithms for the Max-coloring Problem |
STOC
2010
ACM
14 years 1 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
TACAS
2010
Springer
14 years 2 months ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
SIAMDM
2000
13 years 8 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
ECRTS
2004
IEEE
14 years 20 days ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...