Font Size:
a
A
A
Keyword [Prize-collecting]
Result: 1 - 8 | Page: 1 of 1
1.
The Design Of Approximation Algorithm Of The Vertex Cover Extend Problem And The Study Of Graph Invariants
2.
Approximation Algorithms For Some Stochastic Problems Of Combinatorial Optimization
3.
Approximation Algorithms For Some Graph Routing Problems
4.
Approximation Algorithms For The Partial Prize-Collecting Multicut Problems In Trees
5.
An Approximation Algorithm For The Generalized Prize-Collecting Steiner Forest Problem With Submodular Penalties
6.
Approximation Algorithms For The Partial Prize-Collecting Vertex Cover Problems
7.
Approximation Algorithms For Problems Related To The Node-weighted Generalized Steiner Forest Problem
8.
Approximation Algorithms For Partially Prize-Collecting Laminar Cover Problems
<<First
<Prev Next>
Last>>
Jump to
