Found 290 results for "Approximation algorithms"
by International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (1998 Aalborg, Denmark)
The independent set problem is that of finding a maximum size set of mutually non-adjacent vertices in a graph.
We describe here a technique applicable to integer programming problems which we refer to as IP2.
by Klaus Jansen, Stefano Leonardi
by Christopher Nigel Potts
Dynamic provisioning of bandwidth guaranteed paths with fast restoration capability is an important network service feat...
Clustering objects into groups is a common task that arises in many applications such as data mining, web analysis, comp...
by International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (8th 2005 Berkeley, Calif.)
by International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (9th 2006 Barcelona, Spain)