350 search results - page 38 / 70 » Lower bounds and heuristic algorithms for the k |
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
COCOON
2006
Springer
14 years 7 days ago
2006
Springer
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
WG
2005
Springer
14 years 2 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
KI
2001
Springer
14 years 29 days ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...