Searching for authors named "Dimitris Fotakis" – sorted by Relevance.
24 documents found, showing 1 through 10.
Next 10 →
-
Incremental algorithms for facility location and k-median
- …In the incremental versions of Facility Location and k-Median, the demand points arrive one at a time and the algorithm maintains a good solution by either adding each new demand to an existing cluster or placing it in a new singleton cluster. The algorithm can also merge some of the existing cluste…
- Cited by 2 (0 self) – Add To MetaCart
-
On the competitive ratio for online facility location
- …Abstract. We consider the problem of Online Facility Location, where demands arrive online and must be irrevocably assigned to an open facility upon arrival. The objective is to minimize the sum of facility and assignment costs. We prove that the competitive log n ratio for Online Facility Location …
- Cited by 8 (1 self) – Add To MetaCart
-
(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP
- …. The aim of this paper is to present a proof of the equivalence of the equalities NP = PCP(log log n; 1) and P = NP. The proof is based on producing long pseudo-random bit strings through random walks on expander graphs. This technique also implies that for any language in NP there exists a res…
- Cited by 2 (2 self) – Add To MetaCart
-
An Upper Bound on Redundant Assignment Reliability
- …. We investigate the reliability of redundant assignments of colored ball classes to bins failing randomly and independently, where, if a bin fails, all the balls assigned to it are no longer available. In particular, for integers ; 1, we consider at least bins of capacity C and failure probab…
- Add To MetaCart
-
Graph Labelling and Assignment of Non-Reusable Frequencies
- …. In this work, we study Graph Radio Labelling, that is to assign unique integer labels to all the vertices of a graph, such that adjacent vertices get labels at distance at least 2. The objective is to minimize the label span. Radio labelling models the assignment of frequencies, in case that th…
- Add To MetaCart
-
Space Efficient Hash Tables With Worst Case Constant Access Time
- …We generalize Cuckoo Hashing [23] to d-ary Cuckoo Hashing and show how this yields a simple hash table data structure that stores n elements in (1 + ffl) n memory cells, for any constant ffl ? 0. Assuming uniform hashing, accessing or deleting table entries takes at most d = O(ln ffl ) probes …
- Cited by 17 (2 self) – Add To MetaCart
-
Frequency Assignment in Mobile and Radio Networks
- …. We deal with the problem of frequency assignment in mobile and general radio networks, where the signal interferences are modeled using an interference graph G. Our approach uses graph theoretic and optimization techniques. We first study on-line algorithms for frequency assignment in mobile n…
- Cited by 7 (4 self) – Add To MetaCart
-
Atomic congestion games among coalitions
- ……
- Cited by 5 (1 self) – Add To MetaCart
-
Cost-Balancing Tolls for Atomic Network Congestion Games
- …Abstract. We investigate the existence of optimal tolls for atomic symmetric network congestion games with unsplittable traffic and arbitrary non-negative and non-decreasing latency functions. We focus on pure Nash equilibria and a natural toll mechanism, which we call cost-balancing tolls. A set of…
- Cited by 1 (0 self) – Add To MetaCart
-
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
- …Abstract. We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that computes a pure Nash equilibrium with respect to traffic congestion in a network. In this algorithm each user plays o…
- Cited by 9 (6 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
