10 search results - page 2 / 2 » A note on the approximability of cutting stock problems |
128
click to vote
FOCS
1995
IEEE
15 years 4 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...
111
Voted
SIAMCOMP
1998
15 years 11 days ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
136
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
114
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
142
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...