Author image not provided
 Peter Pietrzyk

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article4.29
Citation Count30
Publication count7
Publication years2009-2016
Available for download3
Average downloads per article118.33
Downloads (cumulative)355
Downloads (12 Months)37
Downloads (6 Weeks)3
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


7 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 7 of 7
Sort by:

1
November 2016 Journal of Combinatorial Optimization: Volume 32 Issue 4, November 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We consider online optimization problems in which certain goods have to be acquired in order to provide a service or infrastructure. Classically, decisions for such problems are considered as final: one buys the goods. However, in many real world applications, there is a shift away from the idea of buying ...
Keywords: Online algorithms, Primal dual algorithms, Randomized rounding, Facility location problems, Set cover problems

2 published by ACM
September 2015 ACM Transactions on Parallel Computing (TOPC) - Special Issue for SPAA 2013: Volume 2 Issue 3, October 2015
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Downloads (Overall): 83

Full text available: PDFPDF
We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors and provide a tight analysis of the algorithm’s competitiveness. Our results generalize and improve upon work by Chan et al. [2010], which considers a single speed-scalable processor. Using significantly different techniques, we can not only extend their ...
Keywords: energy, primal-dual, online algorithms, scheduling, Convex programming

3 published by ACM
July 2013 SPAA '13: Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 115

Full text available: PDFPDF
We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors. Moreover, we provide a tight analysis of the algorithm's competitiveness. Our results generalize and improve upon work by Chan et al. [10], which considers a single speed-scalable processor. Using significantly different techniques, we can not only extend ...
Keywords: convex programming, energy, online algorithms, primal-dual, scheduling

4
June 2012 SIROCCO'12: Proceedings of the 19th international conference on Structural Information and Communication Complexity
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

We consider an online facility location problem where clients arrive over time and their demands have to be served by opening facilities and assigning the clients to opened facilities. When opening a facility we must choose one of K different lease types to use. A lease type k has a ...

5
September 2011 ALGOSENSORS'11: Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We present two distributed, constant factor approximation algorithms for the metric facility location problem. Both algorithms have been designed with a strong emphasis on applicability in the area of wireless sensor networks: in order to execute them, each sensor node only requires limited local knowledge and simple computations. Also, the ...

6 published by ACM
June 2011 SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 21
Downloads (6 Weeks): 0,   Downloads (12 Months): 19,   Downloads (Overall): 155

Full text available: PDFPDF
The problem of gathering n autonomous robots in the Euclidean plane at one (not predefined) point is well-studied under various restrictions on the capabilities of the robots and in several time models. However, only very few runtime bounds are known. We consider the scenario of local algorithms in which the ...
Keywords: distributed algorithms, local algorithms, mobile robots, multiagent systems, robot gathering

7
December 2009 Algorithmic Aspects of Wireless Sensor Networks: 5th International Workshop, ALGOSENSORS 2009, Rhodes, Greece, July 10-11, 2009. Revised Selected Papers
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

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 ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us