###
*Nonnumerical* *Algorithms* and Problems

"... Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Mixed multi-unit combinatorial auctions (MMUCAs) offer a high potential to solve SCF problems, and thus be employed for the automated assem ..."

Abstract
- Add to MetaCart

assembly of supply chains of agents. In this paper we present MMUCATS, a test suite for MMUCAs that allows researchers to test, compare, and improve their winner determination

*algorithms*for MMUCAs.###
*Nonnumerical* *Algorithms* and Problems—Sequencing

, 2013

"... We consider a task graph to be executed on a set of processors. We assume that the mapping is given, say by an ordered list of tasks to execute on each processor, and we aim at optimizing the energy consumption while enforcing a prescribed bound on the execution time. While it is not possible to cha ..."

Abstract
- Add to MetaCart

to change the allocation of a task, it is possible to change its speed. We study the complexity of the problem for different models: continuous speeds, discrete modes, distributed either arbitrarily or regularly, and VDD-hopping. Categories and Subject Descriptors F.2.2 [Analysis of

*algorithms*and problem###
*Nonnumerical* *Algorithms* and Problems

"... We study a simple game-theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which the adoption of a common strategy between players has a higher payoff. Classical results in game theory provide a simple con ..."

Abstract
- Add to MetaCart

We study a simple game-theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which the adoption of a common strategy between players has a higher payoff. Classical results in game theory provide a simple condition for the innovation to spread through the network. The present paper characterizes the rate of convergence as a function of graph structure. In particular, we derive a dichotomy between well-connected (e.g. random) graphs that show slow convergence and poorly connected, low dimensional graphs that show fast convergence.

###
*Nonnumerical* *Algorithms* and Problems—Computations

"... We give a randomized (Las-Vegas) parallel algorithm for computing strongly connected components of a graph with n vertices and m edges. The runtime is dominated by O(log 2 n) multi-source parallel reachability queries; i.e. O(log 2 n) calls to a subroutine that computes the union of the descendants ..."

Abstract
- Add to MetaCart

We give a randomized (Las-Vegas) parallel

*algorithm*for computing strongly connected components of a graph with n vertices and m edges. The runtime is dominated by O(log 2 n) multi-source parallel reachability queries; i.e. O(log 2 n) calls to a subroutine that computes the union of the descendants###
*Nonnumerical* *Algorithms* and Problems General

"... We present an algorithm that computes a shortest noncontractible and a shortest non-separating cycle on an orientable combinatorial surface of bounded genus in O(n log n) time, where n denotes the complexity of the surface. This solves a central open problem in computational topology, improving upon ..."

Abstract
- Add to MetaCart

We present an

*algorithm*that computes a shortest noncontractible and a shortest non-separating cycle on an orientable combinatorial surface of bounded genus in O(n log n) time, where n denotes the complexity of the surface. This solves a central open problem in computational topology, improving###
*Nonnumerical* *Algorithms* and Problems—Sequencing and

"... We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the mu ..."

Abstract
- Add to MetaCart

We consider offline scheduling

*algorithms*that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time*algorithms*to compute all non-dominated solutions for the general uniprocessor problem###
*Nonnumerical* *Algorithms* and Problems—computations

"... A simple indicator for an anomaly in a network is a rapid increase in the total number of distinct network connections. While it is fairly easy to maintain an accurate estimate of the current total number of distinct connections using streaming algorithms that exhibit both a low space and computatio ..."

Abstract
- Add to MetaCart

A simple indicator for an anomaly in a network is a rapid increase in the total number of distinct network connections. While it is fairly easy to maintain an accurate estimate of the current total number of distinct connections using streaming

*algorithms*that exhibit both a low space###
*Nonnumerical* *Algorithms* and Problems—geometrical

"... Topology control in ad-hoc networks tries to lower node energy consumption by reducing transmission power and by confining interference, collisions and consequently retransmissions. Commonly low interference is claimed to be a consequence to sparseness of the resulting topology. In this paper we dis ..."

Abstract
- Add to MetaCart

topology control

*algorithms*do not effectively constrain interference. Furthermore we propose connectivity-preserving and spanner constructions that are interference-minimal.###
*Nonnumerical* *Algorithms* and Problems—Geometrical

"... We show that unless NP = RP, it is hard to (even) weakly PAC-learn intersection of two halfspaces in R n using a hypothesis which is a function of up to ℓ linear threshold functions for any integer ℓ. Specifically, we show that for every integer ℓ and an arbitrarily small constant ε> 0, unless NP ..."

Abstract
- Add to MetaCart

NP = RP, no polynomial time

*algorithm*can distinguish whether there is an intersection of two halfspaces that correctly classifies a given set of labeled points in R n, or whether any function of ℓ linear threshold functions can correctly classify at most 1 2 + ε fraction of the points. Categories###
*Nonnumerical* *Algorithms* and Problems

"... In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtual coordinates, rather than real coordinates. In this paper, we address the problem of obtaining virtual coordinates based ..."

Abstract
- Add to MetaCart

based on connectivity information. In particular, we propose the first approximation

*algorithm*for this problem and discuss implementational aspects.