Search Results - "Vignatti, André"

A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs by De Lima, Alane, Da Silva, Murilo, Vignatti, André

“…Let $G$ be an undirected graph with non-negative edge weights and let $S$ be a subset of its shortest paths such that, for every pair $(u,v)$ of distinct…”
Get full text

Percolation centrality via Rademacher Complexity by de Lima, Alane M., da Silva, Murilo V.G., Vignatti, André L.

“…In this work we investigate the problem of estimating the percolation centrality of all vertices in a weighted graph. The percolation centrality measure…”
Get full text

The generalized influence blocking maximization problem by Erd, Fernando C., Vignatti, André L., Silva, Murilo V. G. da

“…Given a network N and a set of nodes that are the starting point for the spread of misinformation across N and an integer k , in the influence blocking…”
Get full text

Minimum vertex cover in generalized random graphs with power law degree distribution by Vignatti, André L., da Silva, Murilo V.G.

“…In this paper we study the approximability of the minimum vertex cover problem in power law graphs. In particular, we investigate the behavior of a standard…”
Get full text

An Approximation Algorithm for the p-Hub Median Problem by Bordini, Camile Frazão, Vignatti, André Luís

“…In the p-hub median problem we are given a set of clients V, a set of demands D⊆V×V, a cost function ρ:V×V→R+, and an integer p>0. The objective is to select…”
Get full text

Blocking the Spread of Misinformation in a Network under Distinct Cost Models by Erd, Fernando C., Vignatti, Andre L., da Silva, Murilo V. G.

“…Given a network N and a set of nodes that are the starting point for the spread of misinformation across N and an integer k, in the influence blocking…”
Get full text

Extending OAI-PMH over structured P2P networks for digital preservation by Seára, Everton F. R., Sunye, Marcos S., Bona, Luis C. E., Vignatti, Tiago, Vignatti, Andre L., Doucet, Anne

“…Open archives initiative (OAI) allows both libraries and museums create and share their own low-cost digital libraries (DL). OAI DL are based on OAI-PMH…”
Get full text

Convergence Time to Nash Equilibrium in Selfish Bin Packing by Miyazawa, Flávio K., Vignatti, André L.

“…We consider a game-theoretic bin packing problem and we study the convergence time to a Nash equilibrium. We show that, if the best-response strategy is used,…”
Get full text

Small World Model based on a Sphere Homeomorphic Geometry by Viertel, Santiago, Vignatti, André Luís

“…We define a small world model over the octahedron surface and relate its distances with those of embedded spheres, preserving constant bounded distortions. The…”
Get full text

Labeling Algorithm and Compact Routing Scheme for a Small World Network Model by Viertel, Santiago, Vignatti, André Luís

“…This paper defines the toroidal small world labeling problem that asks for a labeling of the vertices of a network such that the labels possess information…”
Get full text

Shortest Path Centrality and the APSP problem via VC-dimension and Rademacher Averages by de Lima, Alane M, da Silva, Murilo V. G, Vignatti, André L

“…In this paper we are interested in a version of the All-pairs Shortest Paths problem (APSP) that fits neither in the exact nor in the approximate case. We…”
Get full text

Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory by de Lima, Alane M, da Silva, Murilo V. G, Vignatti, André L

“…In this work we investigate the problem of estimating the percolation centrality of every vertex in a graph. This centrality measure quantifies the importance…”
Get full text

An Indexing for Quadratic Residues Modulo $N$ and a Non-uniform Efficient Decoding Algorithm by Sdroievski, Nicollas M, da Silva, Murilo V. G, Vignatti, André L

“…An \emph{indexing} of a finite set $S$ is a bijection $D : \{1,...,|S|\} \rightarrow S$. We present an indexing for the set of quadratic residues modulo $N$…”
Get full text

Long-term digital archiving based on selection of repositories over P2P networks by Vignatti, T., Bona, L.C.E., Sunye, M.S., Vignatti, A.L.

“…The importance of digital information is constantly increasing in the last years. Such information often needs to be preserved for a long-term and this is the…”
Get full text

Distributed selfish bin packing by Miyazawa, F.K., Vignatti, A.L.

“…We consider a game-theoretic bin packing problem with identical items, and we study the convergence time to a Nash equilibrium. In the model proposed, users…”
Get full text