Font Size:
a
A
A
Keyword [Approximation algorithms]
Result: 61 - 80 | Page: 4 of 6
61.
Approximation algorithms for network design and graph partitioning problems
62.
Approximation algorithms for clustering problems
63.
Metric methods in approximation algorithms
64.
Approximation algorithms for clustering problems
65.
Exploring Approximation Algorithms and Their Empirical Analysis For Selected NP-Complete Problems
66.
Approximation algorithms for a class of resource constrained network optimization problems
67.
Approximation algorithms for single-sink edge installation problems and other graph problems
68.
Improved approximation algorithms for geometric packing problems with experimental evaluation
69.
Design and analysis of approximation algorithms for network optimization problems
70.
Approximation algorithms for concave cost network flow problems
71.
Approximation algorithms for network design problems
72.
Approximation algorithms for problems in scheduling with set-ups
73.
Theoretical and experimental perspectives on hard scheduling problems
74.
Approximation algorithms for graphical models
75.
Vertex cover: Exact and approximation algorithms and applications
76.
Enhancing techniques in LP based approximation algorithms
77.
Approximation algorithms for scheduling problems
78.
Approximation algorithms for scheduling problems
79.
Approximation algorithms for graph-theoretic problems: Planar subgraphs and multiway cut
80.
Approximation algorithms for geometric routing problems
<<First
<Prev
Next>
Last>>
Jump to
