Sciweavers

1161 search results - page 133 / 233
» Approximation schemes for clustering problems
Sort
View
WAOA
2004
Springer
141views Algorithms» more  WAOA 2004»
14 years 2 months ago
Strong Colorings of Hypergraphs
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...
Geir Agnarsson, Magnús M. Halldórsso...
AMC
2010
86views more  AMC 2010»
13 years 9 months ago
BVMs for computing Sturm-Liouville symmetric potentials
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...
Paolo Ghelardoni, Cecilia Magherini
JSCIC
2008
98views more  JSCIC 2008»
13 years 9 months ago
A Posteriori Error Estimates for Parabolic Variational Inequalities
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 ...
Yves Achdou, Frédéric Hecht, David P...
SODA
2003
ACM
107views Algorithms» more  SODA 2003»
13 years 10 months ago
Fault-tolerant facility location
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...
Chaitanya Swamy, David B. Shmoys
FLAIRS
2010
13 years 7 months ago
Decision-Theoretic Simulated Annealing
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...
Todd W. Neller, Christopher J. La Pilla