572 search results - page 14 / 115 » Exponential-Time Approximation of Hard Problems |
94
Voted
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
170
click to vote
SIGMOD
2008
ACM
16 years 18 days ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
90
Voted
FSTTCS
2007
Springer
15 years 6 months ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
ECCC
2007
15 years 13 days ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
108
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...