144 search results - page 4 / 29 » Quality of LP-Based Approximations for Highly Combinatorial ... |
AAAI
2000
14 years 10 months ago
2000
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...
SPAA
2004
ACM
15 years 2 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
108
click to vote
ESA
2011
Springer
13 years 9 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
200
click to vote
SWARM
2012
SPRINGER
13 years 5 months ago
2012
SPRINGER
Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have...