11 citations · 18 across the 6 of their papers we have counts for
6 papers
Prices of anarchy of selfish 2D bin packing games
Cristina G. Fernandes, Carlos E. Ferreira, Flávio K. Miyazawa +1
We consider a game-theoretical problem called selfish 2-dimensional bin packing game, a generalization of the 1-dimensional case already treated in the literature. In this game, th…
The U-curve optimization problem: improvements on the original algorithm and time complexity analysis
Marcelo S. Reis, Carlos E. Ferreira, Junior Barrera
The U-curve optimization problem is characterized by a decomposable in U-shaped curves cost function over the chains of a Boolean lattice. This problem can be applied to model the…
The Unit-Demand Envy-Free Pricing Problem
Cristina G. Fernandes, Carlos E. Ferreira, Álvaro J. P. Franco +1
We consider the unit-demand envy-free pricing problem, which is a unit-demand auction where each bidder receives an item that maximizes his utility, and the goal is to maximize the…
Discriminating different classes of biological networks by analyzing the graphs spectra distribution
Daniel Yasumasa Takahashi, João Ricardo Sato, Carlos Eduardo Ferreira +1
The brain's structural and functional systems, protein-protein interaction, and gene networks are examples of biological systems that share some features of complex networks, such…
Algorithms for Junctions in Directed Acyclic Graphs
Carlos Eduardo Ferreira, Álvaro Junio Pereira Franco
Given a pair of distinct vertices u, v in a graph G, we say that s is a junction of u, v if there are in G internally vertex disjoint directed paths from s to u and from s to v. We…
A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem
Paulo Feofiloff, Cristina G. Fernandes, Carlos E. Ferreira +1
The primal-dual scheme has been used to provide approximation algorithms for many problems. Goemans and Williamson gave a (2-1/(n-1))-approximation for the Prize-Collecting Steiner…