1941 search results - page 72 / 389 » On the Hardness of Approximate Reasoning |
RR
2010
Springer
14 years 10 months ago
2010
Springer
The sparse application of the Semantic Web Rule Language is partly caused by a lack of intuitive rule editors. This applies both from a human user’s, as well as from a software i...
DISOPT
2010
14 years 12 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
MP
2006
14 years 11 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
116
click to vote
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...