activity
20082026
most citedThe Complexity of Testing Properties of Simple Games

5 citations · 10 across the 8 of their papers we have counts for

collaborators

11 papers

cs.DS2026

Online Stacking with a Few Load/Unload Points

Martin Olsen

We consider the stacking problem where items are temporarily stored in stacks in a stacking area. The stacks are working as Last In First Out (LIFO) data structures. The objective…

cs.DS2021

Oblivious Stacking and MAX -CUT for Circle Graphs

Martin Olsen

Stacking is an important process within logistics. Some notable examples of items to be stacked are steel bars or steel plates in a steel yard or containers in a container terminal…

cs.DS2020

An Asymptotically Optimal Algorithm for Online Stacking

Martin Olsen, Allan Gross

Consider a storage area where arriving items are stored temporarily in bounded capacity stacks until their departure. We look into the problem of deciding where to put an arriving…

cs.DS2018

Coverage Centrality Maximization in Undirected Networks

Gianlorenzo D'Angelo, Martin Olsen, Lorenzo Severini

Centrality metrics are among the main tools in social network analysis. Being central for a user of a network leads to several benefits to the user: central users are highly influe…

cs.CC2016

Towards Asymptotically Optimal One-to-One PDP Algorithms for Capacity 2+ Vehicles

Martin Olsen

We consider the one-to-one Pickup and Delivery Problem (PDP) in Euclidean Space with arbitrary dimension where transportation requests are picked i.i.d. with a separate ori…

cs.GT2016

On Covering Codes and Upper Bounds for the Dimension of Simple Games

Martin Olsen

Consider a situation with agents or players where some of the players form a coalition with a certain collective objective. Simple games are used to model systems that can deci…