676 search results - page 61 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
298
click to vote
WADS
2009
Springer
16 years 22 days ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
132
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
181
click to vote
JGAA
2007
15 years 6 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
175
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
152
click to vote
MOC
2000
15 years 6 months ago
2000
We study the pathwise (strong) approximation of scalar stochastic differential equations with respect to the global error in the L2-norm. For equations with additive noise we estab...