Searching for "Approximation Algorithms for Combinatorial Problems" – sorted by Relevance.
-
Algorithms Based on Randomization and Linear and Semidefinite Programming
- programming problems. 1 Introduction Several approximation algorithms for combinatorial problems are somewhat
- Add To MetaCart
-
Fast Partitioning l-apex graphs with Applications to Approximating Maximum Induced
- algorithms. Keywords: Algorithms, Analysis of Algorithms, Approximation Algorithms, Combinatorial Problems
- Cited by 1 (0 self) – Add To MetaCart
-
Multicriteria Approximation Through Decomposition
- Laboratory. 1 Introduction Many recent advances in approximation algorithms for combinatorial problems have
- Cited by 2 (1 self) – Add To MetaCart
-
unknown title
- in biological databases, in addition to immediately yielding approximation algorithms for combinatorial problems
- Add To MetaCart
-
Non-Negative Integral Subset Representations of Integer Sets”, accepted to Information Processing Letters
- , and report on the performance of a greedy heuristic. Keywords: approximation algorithms; combinatorial
- Cited by 2 (1 self) – Add To MetaCart
-
Approximability of Maximum Splitting of k-sets and some other APX-complete Problems
- algorithms for many combinatorial problems (see [4, 7]). In particular, the lower bound techniques have been
- Cited by 14 (0 self) – Add To MetaCart
-
The Weizmann Workshop on Probabilistic Proof Systems
- of results in the area of performance guarantees of approximation algorithms for combinatorial problems
- Add To MetaCart
-
Approximability of identifying codes and locating-dominating codes
- problem of finding minimum-weight codes. Key words: approximation algorithms, combinatorial problems
- Cited by 2 (2 self) – Add To MetaCart

