MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Aris Pagourtzis" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 9 documents found, showing 1 through 9.
ATOM RSS
  • Path Multi-Coloring: Exact and Approximate Solutions  
  • by Christos Nomikos, Aris Pagourtzis, Stathis Zachos
  • …Abstract In this paper we introduce and study the Path Multi-Coloring (PMC) problem: Given a graph, a set of paths, and a number w of colors, the goal is to find a color assignment to paths that minimizes color collisions on each edge. We consider simple topologies of degree two i.e. chains and ring…
  • Add To MetaCart
  • Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks  
  • by Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos — 2003 — In Proceedings of the 3rd IFIP-TC6 Networking Conference, LNCS 3042
  • …Motivated by the increasing importance of multifiber WDM networks we study two routing and wavelength assignment problems in such networks: -- Fiber Cost Minimization: the number of wavelengths per fiber is given and we want to minimize the cost of fiber links that need to be reserved in order …
  • Cited by 4 (3 self) – Add To MetaCart
  • Minimizing Request Blocking in All-Optical Rings  
  • by Christos Nomikos, Aris Pagourtzis, Stathis Zachos — 2003 — In Proc. INFOCOM 2003
  • …In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimizing request blocking is therefore an important task calling for algorithmic techniques for efficient routing and wavelength…
  • Cited by 8 (3 self) – Add To MetaCart
  • Oblivious Gossiping in Ad-Hoc Radio Networks  
  • by Bogdan Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis — 2001 — In Proc. of 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM’2001
  • …We study oblivious deterministic and randomized algorithms for gossiping in unknown radio networks. In oblivious algorithms the fact (or probability in case of randomized algorithm) that a processor transmits or not at a given time-step depends solely on its identification number, the total number o…
  • Cited by 10 (0 self) – Add To MetaCart
  • Equal Sum Subsets: Complexity of Variations  
  • by Mark Cieliebak Stephan, Stephan Eidenbenz, Aris Pagourtzis, Konrad Schlude
  • … ) arising from clause c j = (x f ; x g ; x h ) with x f 2 S and x g = 2 S. Then a g 2 X [ Y , but a f (and a…
  • Add To MetaCart
  • Routing and Wavelength Assignment in Multifiber WDM Networks with Non-Uniform Fiber Cost  
  • by Christos Nomikos, Aris Pagourtzis, Katerina Potika, and Stathis Zachos, Stathis Zachos B — 2005
  • …Motivated by the increasing importance of multifiber WDM networks we study a routing and wavelength assignment problem in such networks. In this problem the number of wavelengths per fiber is given and the goal is to minimize the cost of fiber links that need to be reserved in order to satisfy a set…
  • Cited by 1 (1 self) – Add To MetaCart
  • Server Placements, Roman Domination and Other Dominating Set Variants  
  • by Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer
  • …Dominating sets in their many variations model a wealth of optimization problems like facility location or distributed file sharing. For instance, when a request can occur at any node in a graph and requires a server at that node, a minimumdominating set represents a minimum set of servers that …
  • Cited by 2 (0 self) – Add To MetaCart
  • On the Complexity of Train Assignment Problems  
  • by Thomas Erlebach, Martin Gantenbein, Daniel Hurlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhofel, David Scot Taylor, Peter Widmayer — 2001
  • …We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions by hand, a time-consuming task which is too slow for interaction with the schedule creators. Further, it is difficult to …
  • Add To MetaCart
Help! Showing 1 through 9.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB