1920 search results - page 85 / 384 » The Complexity of the A B C Problem |
125
click to vote
DEXAW
1998
IEEE
15 years 10 months ago
1998
IEEE
Components are nowadays considered the next step in information system development. Components are assumed to foster reuse and flexibility, and reduce the complexity of distribute...
192
Voted
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
169
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
153
click to vote
APPROX
2009
Springer
16 years 22 days ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
151
click to vote
RTSS
1999
IEEE
15 years 10 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...