• Publications
  • Influence
Approximation algorithms for facility location problems (extended abstract)
TLDR
We present new approximation algorithms for several facility location problems. Expand
Models and solution techniques for frequency assignment problems
TLDR
This survey gives an overview of the models and methods that the literature provides on the topic. Expand
A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem
TLDR
We develop a randomized algorithm for the k-level facility location problem that is guaranteed to find a feasible solution of expected cost within a factor of 3 of the optimum cost. Expand
Models and solution techniques for frequency assignment problems
TLDR
This survey gives an overview of the models and methods that the literature provides on the topic. Expand
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
TLDR
We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location (UFL) problem, which improves on the previously best known 1.52 algorithm by Mahdian, Ye, and Zhang. Expand
Capacitated facility location: Separation algorithms and computational experience
  • K. Aardal
  • Computer Science, Mathematics
  • Math. Program.
  • 1 April 1998
TLDR
We consider the polyhedral approach to solving the capacitated facility location problem. Expand
Hard Equality Constrained Integer Knapsacks
We consider the following integer feasibility problem: Given positive integer numbersa0,a1, ... , a n , with gcd( a1,..., a n ) = 1 anda = ( a1,..., a n ), does there exist a vectorx?Z nExpand
On the Two-Level Uncapacitated Facility Location Problem
We study the two-level uncapacitated facility location (TUFL) problem. Given two types of facilities, which we call y-facilities and z-facilities, the problem is to decide which facilities of bothExpand
Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
TLDR
We develop an algorithm for solving a system of diophantine equations with lower and upper bounds on the variables, based on lattice basis reduction. Expand
Factorization of a 512-Bit RSA Modulus
TLDR
This paper reports on the factorization of the 512-bit number RSA-155 by the Number Field Sieve method (NFS) and discusses the implications for RSA. Expand
...
1
2
3
4
5
...