Now showing items 1-7 of 7

    • Edge-partitioning regular graphs for ring traffic grooming with a priori placement od the ADMs 

      Muñoz López, Francisco Javier; Zhentao, Li; Sau Valls, Ignasi (2011)
      Article
      Open Access
      We study the following graph partitioning problem: Given two positive integers C and Δ, find the least integer M(C,Δ) such that the edges of any graph with maximum degree at most Δ can be partitioned into subgraphs with ...
    • Energy and carbon emissions aware services allocation with delay for Data Centers 

      Guillén, Bernat; Hesselbach Serra, Xavier; Muñoz López, Francisco Javier; Klingert, Sonja (2013)
      Conference report
      Restricted access - publisher's policy
      This paper presents a new approach to service assignment in Data Centers (DC), relating it to a classical combinatory problem called Bin Packing Problem and adding the possibility of delay and collaboration with users ...
    • From clutters to matroids 

      Fàbrega Canudas, José; Martí Farré, Jaume; Muñoz López, Francisco Javier (Universidad de Sevilla, 2013)
      Conference report
      Restricted access - publisher's policy
      This paper deals with the question of completing a monotone increasing family of subsets to obtain the dependent sets of a matroid. More precisely, we provide several natural ways of transforming the clutter of the inclusion ...
    • Layer structure of De Bruijn and Kautz digraphs: an application to deflection routing 

      Fàbrega Canudas, José; Martí Farré, Jaume; Muñoz López, Francisco Javier (2016-10-17)
      Article
      Open Access
      In the main part of this paper we present polynomial expressions for the cardinalities of some sets of interest of the nice distance-layer structure of the well-known De Bruijn and Kautz digraphs. More precisely, given a ...
    • Online graph coloring against a randomized adversary 

      Burjons Pujol, Elisabet; Hromkovic, Juraj; Kralovic, Rastislav; Kralovic, Richard; Muñoz López, Francisco Javier; Unger, Walter (2018-06-01)
      Article
      Open Access
      We consider an online model where an adversary constructs a set of 2s instances S instead of one single instance. The algorithm knows S and the adversary will choose one instance from S at random to present to the algorithm. ...
    • Online graph coloring with advice and randomized adversary 

      Muñoz López, Francisco Javier (Springer, 2016)
      Conference report
      Restricted access - publisher's policy
      We generalize the model of online computation with three players (algorithm, adversary and an oracle called advisor) by strength- ening the power of the adversary by randomization. In our generalized model, the advisor ...
    • Online matching in regular bipartite graphs with randomized adversary 

      Fàbrega Canudas, José; Muñoz López, Francisco Javier (Springer, 2018-08)
      Part of book or chapter of book
      Restricted access - publisher's policy