1542 search results - page 75 / 309 » Kernelization of packing problems |
122
click to vote
PRL
2008
15 years 1 months ago
2008
We develop a new multiclass classification method that reduces the multiclass problem to a single binary classifier (SBC). Our method constructs the binary problem by embedding sm...
163
click to vote
EMO
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
115
click to vote
NETWORKS
2006
15 years 1 months ago
2006
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
117
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
EOR
2007
15 years 1 months ago
2007
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...