An information-theoretic framework for the lossy compression of link streams

DOI10.1016/j.tcs.2018.12.009zbMath1436.68103arXiv1807.06874OpenAlexW2883533876WikidataQ128786992 ScholiaQ128786992MaRDI QIDQ2285125

Robin Lamarche-Perrin

Publication date: 16 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.06874

zbMATH Keywords

information theorycombinatorial optimisationstructural equivalencegraph compressionlink streams

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Uses Software

• OEIS
• cliques

Cites Work

• Unnamed Item
• Unnamed Item
• Post-processing hierarchical community structures: quality improvements and multi-scale view
• Computing maximal cliques in link streams
• Applied simulated annealing
• Coalition structure generation with worst case guarantees
• Clique partitions, graph compression and speeding-up algorithms
• Computationally Manageable Combinational Auctions
• Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
• Structured Partitioning Problems
• Set Partitioning: A survey
• Elements of Information Theory
• On Information and Sufficiency
• Algorithm for optimal winner determination in combinatorial auctions

This page was built for publication: An information-theoretic framework for the lossy compression of link streams