Generalized Assignment via Submodular Optimization with Reserved Capacity

An integer generalized transportation model for optimal job assignment in computer networks

V. Balachandran · 1976

Earlier work this paper cites.

Best algorithms for approximating the maximum of a submodular set function

G. L. Nemhauser and L. A. Wolsey · 1978

Earlier work this paper cites.

Computers and Intractability: A Guide to the Theory of NP-Completeness

M. R. Garey and David S. Johnson · 1979

Earlier work this paper cites.

An approximation algorithm for the generalized assignment problem

David B. Shmoys and Éva Tardos · 1993

Earlier work this paper cites.

A threshold of ln ⁡ n \ln n for approximating set cover

Uriel Feige · 1998

Earlier work this paper cites.

Coupling land use allocation models with raster GIS

Robert G. Cromley and Dean M. Hanink · 1999

Earlier work this paper cites.

A note on maximizing a submodular set function subject to knapsack constraint

Maxim Sviridenko · 2004

Earlier work this paper cites.

A PTAS for the multiple knapsack problem

C. Chekuri and S. Khanna · 2006

Earlier work this paper cites.

Approximation algorithms for allocation problems: Improving the factor of 1-1/ e

Uriel Feige and Jan Vondrák · 2006

Earlier work this paper cites.

Optimal approximation for the submodular welfare problem in the value oracle model

Jan Vondrák · 2008

Earlier work this paper cites.

Matching theory

László Lovász and Michael D Plummer · 2009

Cited alongside, same era.

Multi-document summarization via budgeted maximization of submodular functions

Hui Lin and Jeff Bilmes · 2010

Cited alongside, same era.

Maximizing a monotone submodular function subject to a matroid constraint

Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák · 2011

Cited alongside, same era.

A unified continuous greedy algorithm for submodular maximization

M. Feldman, J. Naor, and R. Schwartz · 2011

Cited alongside, same era.

Tight approximation algorithms for maximum separable assignment problems

Lisa Fleischer, Michel X Goemans, Vahab S Mirrokni, and Maxim Sviridenko · 2011

Cited alongside, same era.

Iterative methods in combinatorial optimization

Lap Chi Lau, Ramamoorthi Ravi, and Mohit Singh · 2011

Cited alongside, same era.

All-or-nothing generalized assignment with application to scheduling advertising campaigns

Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, and Tami Tamir · 2016

Later among the works it cites.

Tight approximation bounds for the seminar assignment problem

Amotz Bar-Noy and George Rabanca · 2016

Later among the works it cites.

Deterministic algorithms for submodular maximization problems

Niv Buchbinder and Moran Feldman · 2016

Later among the works it cites.

Packing groups of items into multiple knapsacks

Lin Chen and Guochuan Zhang · 2016

Later among the works it cites.

Code, cache and deliver on the move: A novel caching paradigm in hyper-dense small-cell networks

Konstantinos Poularakis and Leandros Tassiulas · 2016

Later among the works it cites.

VR/AR immersive communication: Caching, edge computing, and transmission trade-offs