2137 search results - page 295 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
162
Voted
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
153
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
159
click to vote
FCT
1993
Springer
15 years 9 months ago
1993
Springer
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
173
click to vote
DM
2006
15 years 5 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
135
click to vote
ICCV
2007
IEEE
16 years 7 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...