17329 search results - page 26 / 3466 » Improved non-approximability results |
APPROX
2006
Springer
14 years 11 days ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
CEAS
2006
Springer
14 years 10 days ago
2006
Springer
ISPs operate "abuse" teams to deal with reports of inappropriate email being sent by their customers. Currently, the majority of this work is dealing with insecure syste...
CIAC
2006
Springer
14 years 10 days ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
WSC
2007
13 years 11 months ago
2007
This article deals with an approach for managing scheduling in semiconductor manufacturing facilities. The proposed approach ensures consistency between global and local schedulin...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...