Refine
Document Type
- Report (5)
- Article (1)
- Conference Proceeding (1)
- Doctoral Thesis (1)
- Preprint (1)
Has Fulltext
- yes (9)
Is part of the Bibliography
- no (9) (remove)
Keywords
Institute
- Mathematik (9) (remove)
We study the approximability of the following NP-complete (in their feasibility recognition forms) number theoretic optimization problems: 1. Given n numbers a1 ; : : : ; an 2 Z, find a minimum gcd set for a1 ; : : : ; an , i.e., a subset S fa1 ; : : : ; ang with minimum cardinality satisfying gcd(S) = gcd(a1 ; : : : ; an ). 2. Given n numbers a1 ; : : : ; an 2 Z, find a 1-minimum gcd multiplier for a1 ; : : : ; an , i.e., a vector x 2 Z n with minimum max 1in jx i j satisfying P n...