| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 4 of 4
reviews
|
|
|
 |
|
|
|
|
The subset assignment problem for data placement in caches
Ghandeharizadeh S., Irani S., Lam J. Algorithmica 80(7): 2201-2220, 2018. Type: Article
This paper gives an approximation algorithm for the subset assignment problem (SAP). Given a set of n items of varying sizes, a set of d bins of varying capacities, and a cost c(...
|
Mar 6 2019 |
|
|
|
|
|
|
New infinite family of regular edge-isoperimetric graphs
Bezrukov S., Bulatovic P., Kuzmanovski N. Theoretical Computer Science 721(C): 42-53, 2018. Type: Article
An application, engineering or otherwise, often triggers the introduction of a new concept of a combinatorial nature. This leads researchers to study related theoretical and computational issues. Again, these problems are usually intra...
|
Aug 10 2018 |
|
|
|
|
|
|
 Steiner tree approximation via iterative randomized rounding
Byrka J., Grandoni F., Rothvoss T., Sanità L. Journal of the ACM 60(1): 1-33, 2013. Type: Article
The Steiner tree problem is an important combinatorial optimization problem with applications in a wide range of areas, such as very-large-scale integration (VLSI) physical design, the design of virtual private networks, and so on. It ...
|
Nov 5 2014 |
|
|
|
|
|
|
Distributed graph coloring: fundamentals and recent developments
Barenboim L., Elkin M., Morgan&Claypool Publishers, San Rafael, CA, 2013. 172 pp. Type: Book (978-1-627050-18-0)
Distributed computing has been an active area of research for a few decades now; we have witnessed significant advances in the principles of distributed computing and the design and analysis of distributed algorithms. Now is the right ...
|
Jul 21 2014 |
|
|
|
|
|
| |
|
|
| |
|
|
