Now showing items 1-3 of 3

  • Can frogs find large independent sets in a decentralized way? Yes they can! 

    Blum, Christian; Blesa Aguilera, Maria Josep; Calvo, Borja (Springer, 2014)
    Conference report
    Open Access
    The problem of identifying a maximal independent (node) set in a given graph is a fundamental problem in distributed computing. It has numerous applications, for example, in wireless networks in the context of facility ...
  • FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs 

    Blum, Christian; Calvo, Borja; Blesa Aguilera, Maria Josep (2015-09-01)
    Article
    Restricted access - publisher's policy
    Finding large (and generally maximal) independent sets of vertices in a given graph is a fundamental problem in distributed computing. Applications include, for example, facility location and backbone formation in wireless ...
  • On solving the most strings with few bad columns problem: An ILP model and heuristics 

    Lizárraga Olivas, Evelia; Blesa Aguilera, Maria Josep; Blum, Christian; Raidl, Günther (Institute of Electrical and Electronics Engineers (IEEE), 2015)
    Conference lecture
    Open Access
    The most strings with few bad columns problem is an NP-hard combinatorial optimization problem from the bioinformatics field. This paper presents the first integer linear programming model for this problem. Moreover, a ...