Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
Algorithmica
Springer-Verlag New York, Inc.
 
   
 
Options:
 
  1-10 of 22 reviews Date Reviewed 
  Induced minor free graphs: isomorphism and clique-width
Belmonte R., Otachi Y., Schweitzer P. Algorithmica 80(1): 29-47, 2018.  Type: Article

A graph H is said to be an induced minor of another graph G “if a graph isomorphic to H can be [constructed] from G by a sequence of vertex deletions...

Apr 2 2019
  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
  Scheduling distributed clusters of parallel machines: primal-dual and LP-based approximation algorithms
Murray R., Khuller S., Chao M. Algorithmica 80(10): 2777-2798, 2018.  Type: Article

As large amounts of data continue to accumulate at never-before-seen rates, it becomes uneconomical to store it at a single location, not to mention storing copies at different locations. One solution is to partition the data and store...

Aug 17 2018
  A moderately exponential time algorithm for k-IBDD satisfiability
Nagao A., Seto K., Teruyama J. Algorithmica 80(10): 2725-2741, 2018.  Type: Article

Branching programs can be modeled using binary decision diagrams (BDDs), which are rooted directed acyclic graphs with vertices labeled using variables of the program, and two sink nodes representing zero and one. In an ordered BDD (OB...

Aug 15 2018
  Improved analysis of complete-linkage clustering
Gro&bgr;wendt A., Röglin H. Algorithmica 78(4): 1131-1150, 2017.  Type: Article

The authors consider the problem of clustering n points in ℝd into k clusters, where the metric on ℝd has yet to be s...

Jul 31 2018
  An FPT 2-approximation for tree-cut decomposition
Kim E., Oum S., Paul C., Sau I., Thilikos D. Algorithmica 80(1): 116-135, 2018.  Type: Article

Fixed-parameter tractable (FPT) computational-complexity classification seeks to measure complexity as functions of problems’ parameters. The algorithm presented in this 20-page advanced paper concerns the FPT approach to &am...

May 7 2018
  Scalable zero knowledge via cycles of elliptic curves
Ben-Sasson E., Chiesa A., Tromer E., Virza M. Algorithmica 79(4): 1102-1160, 2017.  Type: Article

The construction of zk-SNARKs, that is, zero-knowledge succinct non-interactive arguments of knowledge, is the subject of this paper. The reader should be aware that “succinct” is a relative term: the authors note t...

Dec 18 2017
  Counting and generating permutations in regular classes
Basset N. Algorithmica 76(4): 989-1034, 2016.  Type: Article

The signature of a permutation can be described in terms of two symbols that represent ascent and descent in the ordering of the elements. For each regular language (that can be recognized by a finite-state automaton) over those two sy...

May 19 2017
  On minimum sum of radii and diameters clustering
Behsaz B., Salavatipour M. Algorithmica 73(1): 143-165, 2015.  Type: Article

The minimum sum of radii (MSR) problem is that of finding the least possible sum of radii of (at most) k clusters covering a set V of n points, where the points form a graph whos...

Oct 8 2015
  The (weighted) metric dimension of graphs: hard and easy cases
Epstein L., Levin A., Woeginger G. Algorithmica 72(4): 1130-1171, 2015.  Type: Article

Metric dimension (MD) optimization algorithms require computation in such areas as network verification, mastermind games, metric and digital geometry, image digitization, robot navigation, drug discovery, and combinatorics problems. T...

Aug 31 2015
 
 
 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy