144 search results - page 14 / 29 » A Polynomial Time Approximation Scheme for the Square Packin... |
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov
EUROPAR
2010
Springer
13 years 7 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
ICALP
1998
Springer
13 years 11 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
ICC
2009
IEEE
13 years 5 months ago
2009
IEEE
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...