4843 search results - page 349 / 969 » The Shortcut Problem - Complexity and Approximation |
145
click to vote
ACTA
2008
15 years 4 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
131
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper presents a search algorithm for finding functions that are highly correlated with an arbitrary set of data. The functions found by the search can be used to approximate...
125
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
159
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
132
click to vote
FOSSACS
2005
Springer
15 years 10 months ago
2005
Springer
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA∗ 3). They are approached via a combination...