84 search results - page 8 / 17 » A Constant Factor Approximation Algorithm for Generalized Mi... |
146
click to vote
PODS
2007
ACM
16 years 2 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
115
Voted
FSTTCS
2010
Springer
15 years 17 days ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
143
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
139
Voted
IPCO
2007
15 years 4 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
142
Voted
FOCS
1995
IEEE
15 years 6 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...