Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 183

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Network correlated data gathering with explicit communication: NP-completeness and algorithms

Open access
Cristescu, R., Beferull-Lozano, B., Vetterli, M., Wattenhofer, R.·2006·IEEE/ACM Transactions on Networking

Abstract

We consider the problem of correlated data gathering by a network with a sink node and a tree-based communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. For source coding of correlated data, we consider a joint entropy-based coding model with explicit communication where coding is simple and the transmission structure optimization is difficult. We first formulate the optimization problem definition in the general case and then we study further a network setting where the entropy conditioning at nodes does not depend on the amount of side information, but only on its availability. We prove that even in this simple case, the optimization problem is NP-hard. We propose some efficient, scalable, and distributed heuristic approximation algorithms for solving this problem and show by numerical simulations that the total transmission cost can be significantly improved over direct transmission or the shortest path tree. We also present an approximation algorithm that provides a tree transmission structure with total cost within a constant factor from the optimal.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tnet.2005.863711

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 183

Metadata

Authors
Cristescu, R., Beferull-Lozano, B., Vetterli, M., & Wattenhofer, R.
Venue
IEEE/ACM Transactions on Networking
Published
2006-02
Volume
14
Issue
1
Pages
41-54
ISSN
1063-6692 (ISSN-L)
OpenAlex
W2099831016
Cited by
183
References
2
FWCI
17.08
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Network correlated data gathering with explicit communication: NP-completeness and algorithms. https://app.cochat.ai/papers/10.1109/tnet.2005.863711
The paper
Cristescu, R., Beferull-Lozano, B., Vetterli, M., & Wattenhofer, R. (2006). Network correlated data gathering with explicit communication: NP-completeness and algorithms. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2005.863711

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.