Publications related to Spanning tree

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

Right-Protected Data Publishing with Provable Distance-Based Mining

Michail Vlachos, Nikolaos Freris

Protection of one's intellectual property is a topic with important technological and legal facets. We provide mechanisms for establishing the ownership of a dataset consisting of multiple objects. The algorithms also preserve important properties of the d ...

Ieee Computer Soc2014

Evolution and selection of river networks: Statics, dynamics, and complexity

Andrea Rinaldo, Amos Maritan

Moving from the exact result that drainage network configurations minimizing total energy dissipation are stationary solutions of the general equation describing landscape evolution, we review the static properties and the dynamic origins of the scale-inva ...

Natl Acad Sciences2014

Resting-brain functional connectivity predicted by analytic measures of network communication

Jean-Philippe Thiran, Alessandra Griffa, Patric Hagmann, Olaf Sporns

6 The complex relationship between structural and functional connectivity, as measured by noninvasive imaging of the human brain, poses many unresolved challenges and open questions. Here, we apply analytic measures of network communication to the structur ...

Natl Acad Sciences2014

Centrality of Trees for Capacitated k-Center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated k-center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) k locations (called centers) and assign e ...

Springer2014

Zero-temperature Monte Carlo study of the noncoplanar phase of the classical bilinear-biquadratic Heisenberg model on the triangular lattice

Frédéric Mila, Karlo Penc, Sandro Wenzel

We investigate the ground-state properties of the highly degenerate noncoplanar phase of the classical bilinear-biquadratic Heisenberg model on the triangular lattice with Monte Carlo simulations. For that purpose, we introduce an Ising pseudospin represen ...

2013

Linear Function Computation in Networks: Duality and Constant Gap Results

Michael Christoph Gastpar

In linear function computation, multiple source nodes communicate across a relay network to a single destination whose goal is to recover linear functions of the original source data. When the relay network is a linear deterministic network, a duality rela ...

Institute of Electrical and Electronics Engineers2013

Steiner Tree Approximation via Iterative Randomized Rounding

Thomas Rothvoss, Laura Sanità

The Steiner tree problem is one of the most fundamental NP-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree spanning the terminals. In a sequence of papers, the approximation ratio for this problem w ...

Assoc Computing Machinery2013

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Spanning tree

Centrality of trees for capacitated -center

Right-Protected Data Publishing with Provable Distance-Based Mining

Evolution and selection of river networks: Statics, dynamics, and complexity

Resting-brain functional connectivity predicted by analytic measures of network communication

Centrality of Trees for Capacitated k-Center

Zero-temperature Monte Carlo study of the noncoplanar phase of the classical bilinear-biquadratic Heisenberg model on the triangular lattice

Active topology inference using network coding

Linear Function Computation in Networks: Duality and Constant Gap Results

Steiner Tree Approximation via Iterative Randomized Rounding

Degeneracy and ordering of the noncoplanar phase of the classical bilinear-biquadratic Heisenberg model on the triangular lattice

Graph Chatbot

Chat with Graph Search

Centrality of trees for capacitated -center

Resting-brain functional connectivity predicted by analytic measures of network communication

Evolution and selection of river networks: Statics, dynamics, and complexity

Right-Protected Data Publishing with Provable Distance-Based Mining

Active topology inference using network coding

Linear Function Computation in Networks: Duality and Constant Gap Results

Centrality of Trees for Capacitated k-Center

Steiner Tree Approximation via Iterative Randomized Rounding

Zero-temperature Monte Carlo study of the noncoplanar phase of the classical bilinear-biquadratic Heisenberg model on the triangular lattice

Degeneracy and ordering of the noncoplanar phase of the classical bilinear-biquadratic Heisenberg model on the triangular lattice