research unit 1
 

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit Aigaion.nl.SourceForge.hetLogo
Titles (29)Keywords (13)Abstracts (56)
[RACTI-RU1-2008-59] Caragiannis, Ioannis and Monaco, G., A 6/5-approximation algorithm for the maximum 3-cover problem, in: 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008), pages 205-216, 2008.
 
[RACTI-RU1-2011-43] Caragiannis, Ioannis and Monaco, G., A 6/5-approximation algorithm for the maximum 3-cover problem, in: Journal of Combinatorial Optimization, 2011.
 
[RACTI-RU1-2003-42] Caragiannis, Ioannis, Kaklamanis, Christos and Kanellopoulos, Panagiotis, A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem, in: Information Processing Letters, volume 86, number 3, pages 149-154, 2003. [DOI]
 
[RACTI-RU1-2009-58] Athanassopoulos, Stavros, Caragiannis, Ioannis, Kaklamanis, Christos and Kyropoulou, Maria, An improved approximation bound for spanning star forest and color saving, in: 34th International Symposium on Mathematical Foundations of Computer Science (MFCS 2009), pages 90-101, Springer, 2009.
 
[RACTI-RU1-2009-37] Athanassopoulos, Stavros, Caragiannis, Ioannis, Kaklamanis, Christos and Kyropoulou, Maria, An improved approximation bound for spanning star forest and color saving., in: 34th International Symposium on Mathematical Foundations of Computer Science (MFCS 2009), pages 90-101, Springer, High Tatras, Slovakia, 2009.
 
[RACTI-RU1-2007-116] Athanassopoulos, Stavros, Caragiannis, Ioannis and Kaklamanis, Christos, Analysis of approximation algorithms for k-set cover using factor-revealing linear programs, in: Theory of Computing Systems, volume 4639/2007, pages 52-63, 2007. [DOI]
 
[RACTI-RU1-2007-92] Athanassopoulos, Stavros, Caragiannis, Ioannis and Kaklamanis, Christos, Analysis of approximation algorithms for k-set cover using factor-revealing linear programs, in: 16th International Symposium on Fundamentals of Computation Theory (FCT 2007), pages 52-63, Springer, 2007.
 
[RACTI-RU1-2009-56] Athanassopoulos, Stavros, Caragiannis, Ioannis and Kaklamanis, Christos, Analysis of approximation algorithms for k-set cover using factor-revealing linear programs, in: Theory of Computing Systems, volume 45, number 3, pages 555-576, 2009.
 
[RACTI-RU1-2009-40] Athanassopoulos, Stavros, Caragiannis, Ioannis and Kaklamanis, Christos, Analysis of approximation algorithms for k-set cover using factor-revealing linear programs., in: Theory of Computing Systems, volume 45, number 3, pages 555-576, 2009.
 
[RACTI-RU1-2010-18] Caragiannis, Ioannis, Kalaitzis, Dimitris and Markakis, Evangelos, Approximation algorithms and mechanism design for minimax approval voting, in: 24th AAAI Conference on Artificial Intelligence, AAAI 2010, 2010.
 
[RACTI-RU1-2006-43] Caragiannis, Ioannis, Kaklamanis, Christos and Persiano, Giuseppe, Approximation Algorithms for Path Coloring in Trees, The study of the path coloring problem is motivated by the alloc, volume 3484/2006, pages 74-96, chapter Efficient Approximation and Online Algorithms, Springer, 2006. [DOI]
 
[RACTI-RU1-2015-1] Gavalas, Damianos, Konstantopoulos, Charalampos, Mastakas, Konstantinos, Pantziou, Grammati and Vathis, Nikolaos, Approximation Algorithms for the Arc Orienteering Problems, in: Information Processing Letters (indexed in Thomson's ISI Web of Knowledge), volume 115, number 2, pages 313-315, 2015.
 
[RACTI-RU1-2006-79] Efraimidis, Pavlos and Spirakis, Paul, Approximation schemes for scheduling and covering on unrelated machines, in: Theoretical Computer Science (TCS), volume 359, number 1-3, pages 400-417, ISSN 0304-3975, 2006.
 
[RACTI-RU1-2016-37] Spirakis, Paul, Approximations of Bimatrix Nash Equilibria, in: Encyclopedia of Algorithms, pages 137-141, 2016. [DOI]
 
[RACTI-RU1-2017-73] Caragiannis, Ioannis, Gkatzelis, Vasilis and Vinci, Cosimo, Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling, in: Web and Internet Economics - 13th International Conference, WINE 2017, Bangalore, India, December 17-20, 2017, Proceedings, pages 74-87, 2017. [DOI]
 
[RACTI-RU1-2001-17] Fotakis, Dimitris, Nikoletseas, Sotiris, Papadopoulou, Viki and Spirakis, Paul, Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring, in: Computers and Artificial Intelligence, volume 20, number 2, pages 121-180, 2001.
 
[RACTI-RU1-2000-8] Fotakis, Dimitris, Nikoletseas, Sotiris, Papadopoulou, Viki and Spirakis, Paul, NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs, in: 25th International Symposium on Mathematical Foundations of Computer Science (MFCS 2000), pages 363-372, Springer, 2000.
 
[RACTI-RU1-2000-1] Dendris, N, Kirousis, Lefteris, Stamatiou, Yannis and Thilikos, D, On parallel partial solutions and approximation schemes for local consistency in networks of constraints, in: Constraints, volume 5, pages 251-273, 2000.
 
[RACTI-RU1-2002-9] Andreou, Maria, Fotakis, Dimitris, Nikoletseas, Sotiris, Papadopoulou, Viki and Spirakis, Paul, On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations, in: International Symposium on Mathematical Foundations of Computer Science, pages 81-92, 2002.
 
[RACTI-RU1-2005-61] Fotakis, Dimitris, Nikoletseas, Sotiris, Papadopoulou, Viki and Spirakis, Paul, Radiocoloring in planar graphs: Complexity and approximations, in: Theoretical Computer Science (TCS), volume 340, number 3, pages 514-538, 2005. [DOI]
 
[RACTI-RU1-2005-49] Fotakis, Dimitris, Nikoletseas, Sotiris, Papadopoulou, Viki and Spirakis, Paul, Radiocoloring in planar graphs: Complexity and approximations, in: Theoretical Computer Science (TCS), volume 340, number 3, pages 514-538, 2005.
 
[RACTI-RU1-2002-11] Fotakis, Dimitris, Nikoletseas, Sotiris, Papadopoulou, Viki and Spirakis, Paul, Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies, in: 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2002), pages 223-234, Cesky Krumlov, Czech Republic, 2002.
 
[RACTI-RU1-2005-52] Fotakis, Dimitris, Nikoletseas, Sotiris, Papadopoulou, Viki and Spirakis, Paul, Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies, in: Journal of Discrete Algorithms (JDA), volume 2573/2002, pages 223-234, 2005. [DOI]
 
[RACTI-RU1-2006-92] Nikoletseas, Sotiris and Spirakis, Paul, Randomixed Approximation Techniques, Taylor and Francis Books (CRC Press), chapter Approximation Algorithms and Metaheuristcs, 2006.
 
[RACTI-RU1-2000-10] Efraimidis, Pavlos and Spirakis, Paul, Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines, in: Electronic Colloquium on Computational Complexity (ECCC), volume 7, number 7, 2000.
 
[RACTI-RU1-2007-74] Nikoletseas, Sotiris and Spirakis, Paul, Randomized Approximation Techniques, volume 12, Taylor and Francis Books (CRC Press), ISBN 9781584885504, 2007.
 
[RACTI-RU1-2010-20] Caragiannis, Ioannis, Kaklamanis, Christos, Karanikolas, Nikos and Procaccia, A.D., Socially desirable approximations for Dodgson's voting rule, in: 11th ACM Conference on Electronic Commerce, EC 2010, pages 253-262, 2010.
 
[RACTI-RU1-2011-45] Caragiannis, Ioannis, Kaklamanis, Christos, Karanikolas, Nikos and Procaccia, A.D., Socially desirable approximations for Dodgson¢s voting rule, in: ACM Transactions on Algorithms, 2011.
 
[RACTI-RU1-2011-46] Caragiannis, Ioannis, Kaklamanis, Christos and Kyropoulou, Maria, Tight approximation bounds for greedy frugal coverage algorithms, in: 5th International Frontiers of Algorithmics Workshop (FAW 11) and the 7th International Conference on Algorithmic Aspects of Information and Management (AAIM 11), pages 185-195, Springer, 2011.