Sciweavers

12519 search results - page 226 / 2504
» Approximation Problems Categories
Sort
View
JCC
2007
110views more  JCC 2007»
15 years 6 months ago
Electron correlation: The many-body problem at the heart of chemistry
Abstract: The physical interactions among electrons and nuclei, responsible for the chemistry of atoms and molecules, is well described by quantum mechanics and chemistry is theref...
David P. Tew, Wim Klopper, Trygve Helgaker
AAIM
2006
Springer
222views Algorithms» more  AAIM 2006»
16 years 15 days ago
Connected Set Cover Problem and Its Applications
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
Tianping Shuai, Xiao-Dong Hu
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
15 years 8 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 11 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
16 years 21 hour ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...