Publications related to Spanning tree

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian

N

-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset up ...

2012

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian N-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset uppe ...

Ieee2012

Scala to the Power of Z3: Integrating SMT and Programming

Viktor Kuncak, Philippe Paul Henri Suter

We describe a system that integrates the SMT solver Z3 with the Scala programming language. The system supports the use of the SMT solver for checking satisfiability, unsatisfiability, as well as solution enumeration. The embedding of formula trees into Sc ...

Springer-Verlag Berlin2011

Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors

Pascal Fua, Engin Türetken, Germán González Serrano

We present a novel probabilistic approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local evidence, ours builds a set of candidate trees over many different subsets ...

Humana Press2011

Practical issues in the development of a minimalistic power management solution for WSNs

Jorge Miguel Dias Almeida Rodrigues Soares

A flexible Wireless Sensor Network platform for implementation of diverse applications has been developed and deployed at Instituto Superior Técnico - Technical University of Lisbon (IST-TUL). Since its initial deployment in 2007, this testbed has grown st ...

2010

k-Edge-Connectivity: Approximation and LP Relaxation

David Pritchard

This paper's focus is the following family of problems, denoted k-ECSS, where k denotes a positive integer: given a graph (V, E) and costs for each edge, find a minimum-cost subset F of E such that (V, F) is k-edge-connected. For k=1 it is the spanning tre ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

An Improved LP-based Approximation for Steiner Tree

Thomas Rothvoss, Laura Sanità

The Steiner tree problem is one of the most fundamental

\mathbf{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 thi ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2010

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.

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian

N

-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset up ...

2012

An Improved LP-based Approximation for Steiner Tree

Thomas Rothvoss, Laura Sanità

The Steiner tree problem is one of the most fundamental

\mathbf{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 thi ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2010

Spanning tree

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Orthogeodesic Point-Set Embedding of Trees

Maximum likelihood estimation for multiple-source losss tomography with network coding

Scala to the Power of Z3: Integrating SMT and Programming

Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors

Practical issues in the development of a minimalistic power management solution for WSNs

k-Edge-Connectivity: Approximation and LP Relaxation

Stable routing under the Spanning Tree Protocol

An Improved LP-based Approximation for Steiner Tree

Graph Chatbot

Chat with Graph Search

Orthogeodesic Point-Set Embedding of Trees

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Scala to the Power of Z3: Integrating SMT and Programming

Maximum likelihood estimation for multiple-source losss tomography with network coding

Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Stable routing under the Spanning Tree Protocol

k-Edge-Connectivity: Approximation and LP Relaxation

Practical issues in the development of a minimalistic power management solution for WSNs

An Improved LP-based Approximation for Steiner Tree