Classical approaches to location problems are based on the minimization of the average distance (the median concept) or the minimization of the maximum distance (the center concept...
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
Due to the success of differential and linear attacks on a large number of encryption algorithms, it is importanttoinvestigaterelationshipsamongvariouscryptographic, includingdiffe...
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...