Filters

Advanced Search Browse by Genre

Found 290 results for "Approximation algorithms"

Approximation algorithms for combinatorial optimization
Approximation algorithms for combinatorial optimization

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.

1998 2 ed.
Approximation algorithms for combinatorial optimization
Approximation algorithms for combinatorial optimization

We describe here a technique applicable to integer programming problems which we refer to as IP2.

2000 1 ed.
Efficiency of Wireless Networks
Efficiency of Wireless Networks

by Olga Goussevskaia, Yvonne-Anne Pignolet

2010 1 ed.
Approximation, randomization, and combinatorial optimization : algorithms and techniques
Approximation, randomization, and combinatorial optimization...

Dynamic provisioning of bandwidth guaranteed paths with fast restoration capability is an important network service feat...

2004 1 ed.
Approximation, randomization, and combinatorial optimization
Approximation, randomization, and combinatorial optimization

Clustering objects into groups is a common task that arises in many applications such as data mining, web analysis, comp...

2003 1 ed.
Approximation, randomization, and combinatorial optimization
Approximation, randomization, and combinatorial optimization

by International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (8th 2005 Berkeley, Calif.)

2005 1 ed.
Approximation, randomization and combinatorial optimization
Approximation, randomization and combinatorial optimization

by International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (9th 2006 Barcelona, Spain)

2006 1 ed.