The topic of this report is the Koutsoupias-Papadimitriou (KP) game-theoretic model for a class of job-scheduling problems. It contains a presentation of the results from the original paper by Koutsoupias and Papadmitriou [1] and a... more
The topic of this report is the Koutsoupias-Papadimitriou (KP) game-theoretic model for a class of job-scheduling problems. It contains a presentation of the results from the original paper by Koutsoupias and Papadmitriou [1] and a follow-up paper by Czumaj and Vöcking [4]. The papers address the problem of bounding the ratio between the worst case Nash equilibrium and optimum allocation of a set of jobs to a set of machines.
We consider a scenario in which there are resources at or near nodes of a network, which are either static (eg fire stations, parking spots) or mobile (eg police cars). Over time, events (fires, crime reports, cars looking for parking)... more
We consider a scenario in which there are resources at or near nodes of a network, which are either static (eg fire stations, parking spots) or mobile (eg police cars). Over time, events (fires, crime reports, cars looking for parking) arise one-by-one at arbitrary nodes, ...
Page 1. On Complexity of Wireless Gathering Problems on Unit-Disk Graphs NikolaMilosavljevic ⋆ Max-Planck-Institut für Informatik, Saarbrücken, Germany nikolam@mpi-inf.mpg.de Abstract. We address the problem of efficient ...
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Algorithms for reconstructing a 2-manifold from a point sample in R 3 based on Voronoifiltering like CRUST [1] or CoCone [2] still require – after identifying a set of candidate triangles – a so-called manifold extraction step which... more
Algorithms for reconstructing a 2-manifold from a point sample in R 3 based on Voronoifiltering like CRUST [1] or CoCone [2] still require – after identifying a set of candidate triangles – a so-called manifold extraction step which identifies a subset of the candidate triangles to form the final reconstruction surface. Non-locality of the latter step is caused by so-called slivers – configurations of 4 almost cocircular points having an empty circumsphere with center close to the manifold surface. We prove that under a certain mild condition – local uniformity – which typically holds in practice but can also be enforced theoretically, one can compute a reconstruction using an algorithm whose decisions about the adjacencies of a point only depend on nearby points. While the theoretical proof requires an extremely high sampling density, our prototype implementation – which is described in a companion paper [5] – exhibits pretty good results on typical sample sets and might have some potential in particular in parallel computing or external memory scenarios due to its local mode of computation. 1 1
Research Interests:
Research Interests: Computer Science, Algorithms, Distributed Computing, Computer Graphics, Design, and 15 moreComputer Networks, Theory, Probabilistic Logic, Ad Hoc Networks, Sensor networks, Protocols, Algorithm Design, Sensor Network, Rare Event, Sparse Data, Sensor Networks, Sensor nodes, Information Aggregation, Cumulant, and Data Duplication
Research Interests:
Research Interests:
Research Interests:
Known algorithms for reconstructing a 2-manifold from a point sample in R 3 are naturally based on decisions/predicates that take the geometry of the point sample into account. Facing the always present problem of round-off errors that... more
Known algorithms for reconstructing a 2-manifold from a point sample in R 3 are naturally based on decisions/predicates that take the geometry of the point sample into account. Facing the always present problem of round-off errors that easily compromise the exactness of those predicate decisions, an exact and robust implementation of these algorithms is far from being trivial and typically requires employment of advanced datatypes for exact arithmetic, as provided by libraries like CORE, LEDA, or GMP. In this article, we present a new reconstruction algorithm, one whose main novelties is to throw away geometry information early on in the reconstruction process and to mainly operate combinatorially on a graph structure. More precisely, our algorithm only requires distances between the sample points and not the actual embedding in R 3 . As such, it is less susceptible to robustness problems due to round-off errors and also benefits from not requiring expensive exact arithmetic by fast...
Research Interests:
Research Interests:
Wireless sensor networks typically consist of small, very simple network nodes without any positioning device like GPS. After an initialization phase, the nodes know with whom they can talk directly, but have no idea about their relative... more
Wireless sensor networks typically consist of small, very simple network nodes without any positioning device like GPS. After an initialization phase, the nodes know with whom they can talk directly, but have no idea about their relative geographic locations. We ...
Research Interests:
AbstractWe study the problem of landmark selection for landmark-based routing in a network of fixed wireless com-munication nodes. We present a distributed landmark selection algorithm that does not rely on global clock synchronization,... more
AbstractWe study the problem of landmark selection for landmark-based routing in a network of fixed wireless com-munication nodes. We present a distributed landmark selection algorithm that does not rely on global clock synchronization, and a companion local greedy ...