1542 search results - page 41 / 309 » Kernelization of packing problems |
139
click to vote
EMNLP
2007
15 years 2 months ago
2007
This paper proposes a tree kernel with contextsensitive structured parse tree information for relation extraction. It resolves two critical problems in previous tree kernels for r...
154
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
107
click to vote
IEAAIE
2010
Springer
14 years 11 months ago
2010
Springer
This paper introduces a new tabu search algorithm for a strip packing problem. It integrates several key features: A consistent neighborhood, a fitness function including problem k...
108
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
116
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...