7930 search results - page 152 / 1586 » Greedy in Approximation Algorithms |
266
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
153
click to vote
SAC
2006
ACM
16 years 10 days ago
2006
ACM
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
161
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
223
click to vote
WG
2005
Springer
15 years 12 months ago
2005
Springer
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
172
click to vote
OPODIS
2007
15 years 7 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...