An Achievable Region for the Double Unicast Problem Based on a Minimum Cut Analysis

IEEE Transactions on Communications - United States
doi 10.1109/tcomm.2013.053013.120542
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

What Is the Best Achievable QoS for Unicast Routing in VANETs?

2008English

An Edge-Based Crossover for the Capacitated Minimum Spanning Tree Problem

2016English

An Achievable Rate Region for the Two-Way Two-Relay Channel

2008English

The Minimum Steiner Tree Problem Based on Genetic Algorithm

DEStech Transactions on Computer Science and Engineering
2018English

Robust Branch-Cut-And-Price for the Capacitated Minimum Spanning Tree Problem Over a Large Extended Formulation

Mathematical Programming, Series B
MathematicsSoftware
2006English

An Optimal Algorithm for the Minimum Disc Cover Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2007English

An Achievable Data-Rate Region Subject to a Stationary Performance Constraint for LTI Plants

IEEE Transactions on Automatic Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2011English

Research on the Secrecy Achievable Rate Region for the Broadcast Channel With Eavesdropper

2013English

Velocity Analysis Based on Minimum Entropy

Geophysics
PetrologyEnergyGeochemistryGeophysics
1984English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy