841 search results - page 28 / 169 » Approximability of Minimum AND-Circuits |
MOR
2006
13 years 8 months ago
2006
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
CSE
2008
IEEE
13 years 10 months ago
2008
IEEE
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Given a bidirected ring with capacities and a demand graph, we present an approximate solution to the problem of nding the minimum such that there exists a feasible routing of the...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...