50 search results - page 5 / 10 » Approximation schemes for multidimensional packing |
IPL
2007
13 years 8 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
FOCS
2004
IEEE
14 years 7 days ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
VTC
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— In this paper we consider serially concatenated and iteratively decoded Irregular Variable Length Coding (IrVLC) combined with precoded Differential Space-Time Spreadin...
WAOA
2005
Springer
14 years 2 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...