Results 1 to 10 of about 8,109 (197)
Online Bin Covering: Expectations vs. Guarantees [PDF]
, 2013 Bin covering is a dual version of classic bin packing. Thus, the goal is to cover as many bins as possible, where covering a bin means packing items of total size at least one in the bin.
Christ, Marie G. +2 more
core +1 more source
Packing Cars into Narrow Roads: PTASs for Limited Supply Highway [PDF]
, 2019 In the Highway problem, we are given a path with n edges (the highway), and a set of m drivers, each one characterized by a subpath and a budget. For a given assignment of edge prices (the tolls), the highway owner collects from each driver the total ...
Grandoni, Fabrizio, Wiese, Andreas
core +1 more source
A study on exponential-size neighborhoods for the bin packing problem with conflicts
, 2017 We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various ...
Capua, Renatha +3 more
core +1 more source
Dagstuhl Reports : Volume 1, Issue 2, February 2011 [PDF]
, 2011 Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs ...
Schloss Dagstuhl, Leibniz-Zentrum für Informatik
core
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design [PDF]
, 2014 R. Lavy and C. Swamy (FOCS 2005, J. ACM 2011) introduced a general method for obtaining truthful-in-expectation mechanisms from linear programming based approximation algorithms.
D Bienstock +7 more
core +3 more sources
On Minimum Maximal Distance-k Matchings
, 2018 We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge analogue of $k$
Kartynnik, Yury, Ryzhikov, Andrew
core +1 more source
A Geometric Theorem for Network Design [PDF]
, 2004 Consider an infinite square grid G. How many discs of given radius r, centered at the vertices of G, are required, in the worst case, to completely cover an arbitrary disc of radius r placed on the plane? We show that this number is an integer in the set
Bruck, Jehoshua +2 more
core +1 more source
Problems on q-Analogs in Coding Theory [PDF]
, 2013 The interest in $q$-analogs of codes and designs has been increased in the last few years as a consequence of their new application in error-correction for random network coding. There are many interesting theoretical, algebraic, and combinatorial coding
Etzion, Tuvi
core
Generalized covering designs and clique coverings
, 2011 Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835--4842], we define a new class of combinatorial designs which simultaneously provide a generalization of both ...
Bailey, Robert F. +3 more
core +2 more sources
Algorithms to Approximate Column-Sparse Packing Problems
, 2019 Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation algorithms for ...
Brubach, Brian +3 more
core +1 more source