2137 search results - page 174 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
170
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
153
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
159
Voted
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
158
click to vote
DATE
2003
IEEE
15 years 11 months ago
2003
IEEE
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...
210
click to vote
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...