1161 search results - page 133 / 233 » Approximation schemes for clustering problems |
144
click to vote
WAOA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
99
Voted
AMC
2010
15 years 3 months ago
2010
The paper deals with the numerical solution of inverse Sturm-Liouville problems with unknown potential symmetric over the interval [0, ]. The proposed method is based on the use o...
129
click to vote
JSCIC
2008
15 years 3 months ago
2008
We study a posteriori error estimates in the energy norm for some parabolic obstacle problems discretized with a Euler implicit time scheme combined with a finite element spatial ...
120
Voted
SODA
2003
ACM
15 years 4 months ago
2003
ACM
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...
142
Voted
FLAIRS
2010
15 years 1 months ago
2010
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...