103 search results - page 11 / 21 » Language, Definition and Optimal Computation of CSP Approxim... |
AI
2002
Springer
13 years 8 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
IDEAS
2008
IEEE
14 years 3 months ago
2008
IEEE
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
CP
2009
Springer
14 years 3 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...