3875 search results - page 55 / 775 » Approximation Algorithms for the Max-coloring Problem |
MOC
2000
13 years 8 months ago
2000
The probabilistic approach is used for constructing special layer methods to solve the Cauchy problem for semilinear parabolic equations with small parameter. Despite their probabi...
EVOW
2006
Springer
14 years 14 days ago
2006
Springer
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
DAM
1999
13 years 8 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
JCO
2008
13 years 8 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...