[图书][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 …

An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization

J Byrka, T Pensyl, B Rybicki, A Srinivasan… - ACM Transactions on …, 2017 - dl.acm.org
Dependent rounding is a useful technique for optimization problems with hard budget
constraints. This framework naturally leads to negative correlation properties. However, what …

Toward reliable and scalable internet of vehicles: Performance analysis and resource management

Y Ni, L Cai, J He, A Vinel, Y Li… - Proceedings of the …, 2019 - ieeexplore.ieee.org
Reliable and scalable wireless transmissions for Internet of Vehicles (IoV) are technically
challenging. Each vehicle, from driver-assisted to automated one, will generate a flood of …

LP-based algorithms for capacitated facility location

HC An, M Singh, O Svensson - SIAM Journal on Computing, 2017 - SIAM
Linear programming (LP) has played a key role in the study of algorithms for combinatorial
optimization problems. In the field of approximation algorithms, this is well illustrated by the …

SDN-enabled energy-aware routing in underwater multi-modal communication networks

R Ruby, S Zhong, BM ElHalawany… - … /ACM Transactions on …, 2021 - ieeexplore.ieee.org
Despite extensive research efforts, underwater sensor networks (UWSNs) still suffer from
serious performance issues due to their inefficient and uncoordinated channel access and …

Joint roadside unit deployment and service task assignment for Internet of Vehicles (IoV)

Y Ni, J He, L Cai, J Pan, Y Bo - IEEE Internet of Things Journal, 2018 - ieeexplore.ieee.org
Internet of Vehicles (IoV) is a promising Internet of Things application, where roadside unit
(RSU) plays an important role for network service provisioning. How to select the number …

[图书][B] Was ist kombinatorische Optimierung?

B Korte, J Vygen - 1985 - Springer
Beginnen wir mit zwei Beispielen. Eine Firma betreibt eine Maschine, mit der Löcher in
Leiterplatten gebohrt werden. Da sie viele dieser Platinen herstellt, möchte sie erreichen …

Approximation algorithms for hard capacitated k-facility location problems

K Aardal, PL van den Berg, D Gijswijt, S Li - European Journal of …, 2015 - Elsevier
We study the capacitated k-facility location problem, in which we are given a set of clients
with demands, a set of facilities with capacities and a positive integer k. It costs fi to open …

Cache optimization models and algorithms

G Paschos, G Iosifidis, G Caire - Foundations and Trends® in …, 2020 - nowpublishers.com
Caching refers to the act of replicating information at a faster (or closer) medium with the
purpose of improving performance. This deceptively simple idea has given rise to some of …

Facility location problem with capacity constraints: Algorithmic and mechanism design perspectives

H Aziz, H Chan, B Lee, B Li, T Walsh - … of the AAAI Conference on Artificial …, 2020 - aaai.org
We consider the facility location problem in the one-dimensional setting where each facility
can serve a limited number of agents from the algorithmic and mechanism design …