[KİTAP][B] Combinatorial optimization
BH Korte, J Vygen, B Korte, J Vygen - 2011 - Springer
Let us start with two examples. A company has a machine which drills holes into printed
circuit boards. Since it produces many of these boards it wants the machine to complete one …
circuit boards. Since it produces many of these boards it wants the machine to complete one …
[KİTAP][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
Approximating k-median via pseudo-approximation
We present a novel approximation algorithm for k-median that achieves an approximation
guarantee of 1+√ 3+ ε, improving upon the decade-old ratio of 3+ ε. Our approach is based …
guarantee of 1+√ 3+ ε, improving upon the decade-old ratio of 3+ ε. Our approach is based …
[HTML][HTML] A 1.488 approximation algorithm for the uncapacitated facility location problem
S Li - Information and Computation, 2013 - Elsevier
We present a 1.488-approximation algorithm for the metric uncapacitated facility location
(UFL) problem. Previously, the best algorithm was due to Byrka (2007). Byrka proposed an …
(UFL) problem. Previously, the best algorithm was due to Byrka (2007). Byrka proposed an …
Online bipartite matching with random arrivals: an approach based on strongly factor-revealing lps
In a seminal paper, Karp, Vazirani, and Vazirani show that a simple ranking algorithm
achieves a competitive ratio of 1-1/e for the online bipartite matching problem in the …
achieves a competitive ratio of 1-1/e for the online bipartite matching problem in the …
The reliable facility location problem: Formulations, heuristics, and approximation algorithms
We study a reliable facility location problem wherein some facilities are subject to failure
from time to time. If a facility fails, customers originally assigned to it have to be reassigned to …
from time to time. If a facility fails, customers originally assigned to it have to be reassigned to …
Online graph algorithms with predictions
Online algorithms with predictions is a popular and elegant framework for bypassing
pessimistic lower bounds in competitive analysis. In this model, online algorithms are …
pessimistic lower bounds in competitive analysis. In this model, online algorithms are …
Constant approximation for k-median and k-means with outliers via iterative rounding
In this paper, we present a new iterative rounding framework for many clustering problems.
Using this, we obtain an (α1+ є≤ 7.081+ є)-approximation algorithm for k-median with …
Using this, we obtain an (α1+ є≤ 7.081+ є)-approximation algorithm for k-median with …
An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location (UFL)
problem, which improves on the previously best known 1.52-approximation algorithm by …
problem, which improves on the previously best known 1.52-approximation algorithm by …
Learning to propose objects
We present an approach for highly accurate bottom-up object segmentation. Given an
image, the approach rapidly generates a set of regions that delineate candidate objects in …
image, the approach rapidly generates a set of regions that delineate candidate objects in …