14 search results - page 2 / 3 » Lagrangian Relaxation and Partial Cover |
WAOA
2005
Springer
13 years 10 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
MICCAI
2009
Springer
14 years 9 days ago
2009
Springer
Abstract. Thickness measurements of the cerebral cortex can aid diagnosis and provide valuable information about the temporal evolution of several diseases such as Alzheimer’s, H...
EOR
2007
13 years 5 months ago
2007
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with pro�...
WWW
2006
ACM
14 years 6 months ago
2006
ACM
To maintain interoperability in the Web environment it is necessary to comply with Web standards. Current specifications of HTML and XHTML languages define conformance conditions ...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...