@inbook{19724,
  abstract     = {{We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in $\classP$ or are $\classNP$-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with $\bigO(\log^*n)$ communication rounds.}},
  author       = {{Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter}},
  booktitle    = {{Algorithmic Aspects of Wireless Sensor Networks}},
  isbn         = {{9783642054334}},
  issn         = {{0302-9743}},
  pages        = {{252--262}},
  publisher    = {{Springer}},
  title        = {{{Complexity and Approximation of a Geometric Local Robot Assignment Problem}}},
  doi          = {{10.1007/978-3-642-05434-1_25}},
  year         = {{2009}},
}

@inbook{2920,
  author       = {{Kakvi, Saqib}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783642040511}},
  issn         = {{0302-9743}},
  pages        = {{300--301}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Reinforcement Learning for Blackjack}}},
  doi          = {{10.1007/978-3-642-04052-8_43}},
  year         = {{2009}},
}

@inbook{3000,
  author       = {{Schrieb, Jonas and Wehrheim, Heike and Wonisch, Daniel}},
  booktitle    = {{FM 2009: Formal Methods}},
  isbn         = {{9783642050886}},
  issn         = {{0302-9743}},
  pages        = {{106--122}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Three-Valued Spotlight Abstractions}}},
  doi          = {{10.1007/978-3-642-05089-3_8}},
  year         = {{2009}},
}

@inbook{23744,
  abstract     = {{In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset of the items. We focus on the case of computationally bounded followers who cannot optimize exactly over the range of all feasible subsets, but apply some publicly known algorithm to determine the set of items to purchase. This corresponds to general multi-dimensional pricing assuming that consumers cannot optimize over the full domain of their valuation functions but still aim to act rationally to the best of their ability.

We consider two versions of this novel type of Stackelberg pricing games. Assuming that items are weighted objects and the follower seeks to purchase a min-cost selection of objects of some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate algorithm, we show how an extension of the known single-price algorithm can be used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s revenue maximization problem based on so-called near-uniform price assignments. We also prove the problem to be strongly NP-hard.

Considering the case that items are subsets of some ground set which the follower seeks to cover (the Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform price assignments fail to yield a good approximation guarantee. However, in the special case of elements with frequency 2 (the Vertex-Cover problem) it turns out that exact revenue maximization can be done in polynomial-time. This stands in sharp contrast to the fact that revenue maximization becomes APX-hard already for elements with frequency 3.}},
  author       = {{Briest, Patrick and Hoefer, Martin and Gualà, Luciano and Ventre, Carmine}},
  booktitle    = {{Lecture Notes in Computer Science}},
  issn         = {{0302-9743}},
  title        = {{{On Stackelberg Pricing with Computationally Bounded Consumers}}},
  doi          = {{10.1007/978-3-642-10841-9_6}},
  year         = {{2009}},
}

@inbook{1830,
  author       = {{Biermann, Thorsten and Schwabe, Arne and Karl, Holger}},
  booktitle    = {{NETWORKING 2009}},
  isbn         = {{9783642013980}},
  issn         = {{0302-9743}},
  pages        = {{883--894}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE}}},
  doi          = {{10.1007/978-3-642-01399-7_69}},
  year         = {{2009}},
}

@inbook{9616,
  author       = {{Kakvi, Saqib}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783642040511}},
  issn         = {{0302-9743}},
  title        = {{{Reinforcement Learning for Blackjack}}},
  doi          = {{10.1007/978-3-642-04052-8_43}},
  year         = {{2009}},
}

@proceedings{61021,
  editor       = {{Mertsching, Bärbel and Hund, Marcus and Aziz, Zaheer}},
  isbn         = {{9783642046162}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{KI 2009: Advances in Artificial Intelligence}}},
  doi          = {{10.1007/978-3-642-04617-9}},
  year         = {{2009}},
}

@inproceedings{66535,
  author       = {{Hund, Marcus and Mertsching, Bärbel}},
  booktitle    = {{KI 2009: Advances in Artificial Intelligence}},
  isbn         = {{9783642046162}},
  issn         = {{0302-9743}},
  location     = {{Paderborn}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Occlusion as a Monocular Depth Cue Derived from Illusory Contour Perception}}},
  doi          = {{10.1007/978-3-642-04617-9_13}},
  year         = {{2009}},
}

@inproceedings{19686,
  author       = {{Briest, Patrick}},
  booktitle    = {{Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)}},
  isbn         = {{9783540705741}},
  issn         = {{0302-9743}},
  title        = {{{Uniform Budgets and the Envy-Free Pricing Problem}}},
  doi          = {{10.1007/978-3-540-70575-8_66}},
  year         = {{2008}},
}

@inproceedings{19003,
  author       = {{Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}},
  booktitle    = {{Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)}},
  isbn         = {{9783540699002}},
  issn         = {{0302-9743}},
  pages        = {{378--389}},
  title        = {{{The Kinetic Facility Location Problem}}},
  doi          = {{10.1007/978-3-540-69903-3_34}},
  year         = {{2008}},
}

@inproceedings{20367,
  author       = {{Hamann, Heiko and Wörn, Heinz}},
  booktitle    = {{The tenth International Conference on Simulation of Adaptive Behavior (SAB'08)}},
  isbn         = {{9783540691334}},
  issn         = {{0302-9743}},
  pages        = {{447----456}},
  title        = {{{Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem}}},
  doi          = {{10.1007/978-3-540-69134-1_44}},
  volume       = {{5040}},
  year         = {{2008}},
}

@inbook{17978,
  author       = {{Lürwer-Brüggemeier, Katharina and Ziegler, Martin}},
  booktitle    = {{Unconventional Computing}},
  isbn         = {{9783540851936}},
  issn         = {{0302-9743}},
  title        = {{{On Faster Integer Calculations Using Non-arithmetic Primitives}}},
  doi          = {{10.1007/978-3-540-85194-3_11}},
  year         = {{2008}},
}

@inproceedings{24276,
  abstract     = {{We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in metric spaces with some demands and resources given at its points. The demands may vary with time, but the total demand may never exceed k. The goal of an online algorithm is to satisfy demands by moving resources, while minimizing the cost for transporting resources. We give an asymptotically optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive deterministic one for the k-resource problem on uniform metric spaces consisting of n points. This extends known results for paging to the more general setting of k-resource.
Basing on the results for uniform metric spaces, we develop a randomized algorithm solving the k-resource and the k-server problem on metric spaces which can be decomposed into components far away from each other. The algorithm achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra resources more than the optimal algorithm.
}},
  author       = {{Bienkowski, Marcin and Kutyłowski, Jarosław}},
  booktitle    = {{Lecture Notes in Computer Science}},
  issn         = {{0302-9743}},
  title        = {{{The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces}}},
  doi          = {{10.1007/978-3-540-73951-7_30}},
  year         = {{2007}},
}

@inbook{3019,
  author       = {{May, Alexander}},
  booktitle    = {{Advances in Cryptology — CRYPTO 2002}},
  isbn         = {{9783540440505}},
  issn         = {{0302-9743}},
  pages        = {{242--256}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Cryptanalysis of Unbalanced RSA with Small CRT-Exponent}}},
  doi          = {{10.1007/3-540-45708-9_16}},
  year         = {{2007}},
}

@inbook{3020,
  author       = {{Blömer, Johannes and May, Alexander}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540424888}},
  issn         = {{0302-9743}},
  pages        = {{4--19}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Low Secret Exponent RSA Revisited}}},
  doi          = {{10.1007/3-540-44670-2_2}},
  year         = {{2007}},
}

@inbook{3021,
  author       = {{Blömer, Johannes and May, Alexander}},
  booktitle    = {{Selected Areas in Cryptography}},
  isbn         = {{9783540430667}},
  issn         = {{0302-9743}},
  pages        = {{325--341}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Key Revocation with Interval Cover Families}}},
  doi          = {{10.1007/3-540-45537-x_26}},
  year         = {{2007}},
}

@inbook{3022,
  author       = {{May, Alexander and Silverman, Joseph H.}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540424888}},
  issn         = {{0302-9743}},
  pages        = {{110--125}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Dimension Reduction Methods for Convolution Modular Lattices}}},
  doi          = {{10.1007/3-540-44670-2_10}},
  year         = {{2007}},
}

@inbook{3026,
  author       = {{Blömer, Johannes}},
  booktitle    = {{Algorithms — ESA’ 98}},
  isbn         = {{9783540648482}},
  issn         = {{0302-9743}},
  pages        = {{151--162}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers}}},
  doi          = {{10.1007/3-540-68530-8_13}},
  year         = {{2007}},
}

@inproceedings{18929,
  author       = {{Dynia, Miroslaw and Korzeniowski, Miroslaw and Kutyłowski, Jarosław}},
  booktitle    = {{Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)}},
  isbn         = {{9783540695066}},
  issn         = {{0302-9743}},
  pages        = {{260----271}},
  title        = {{{Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs}}},
  doi          = {{10.1007/978-3-540-69507-3_21}},
  volume       = {{4362}},
  year         = {{2007}},
}

@inbook{17982,
  author       = {{Ziegler, Martin}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540730002}},
  issn         = {{0302-9743}},
  title        = {{{(Short) Survey of Real Hypercomputation}}},
  doi          = {{10.1007/978-3-540-73001-9_86}},
  year         = {{2007}},
}