379 search results - page 5 / 76 » The Graham-Knowlton Problem Revisited |
98
Voted
WEA
2010
Springer
15 years 6 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
SEMWEB
2004
Springer
15 years 5 months ago
2004
Springer
The problem of data semantics is establishing and maintaining the correspondence between a data source and its intended subject matter. We review the long history of the problem in...
112
Voted
TCS
2010
14 years 10 months ago
2010
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
94
Voted
DCC
2007
IEEE
15 years 11 months ago
2007
IEEE
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
128
click to vote
COCOON
2009
Springer
15 years 6 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...