Kernels for storage capacity and dual index coding
From MaRDI portal
Distributed systems (68M14) Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)
Cites work
- Exact algorithms for maximum independent set
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- Hardness of linear index coding on perturbed instances
- scientific article; zbMATH DE number 5454110 (Why is no real title available?)
- scientific article; zbMATH DE number 3745081 (Why is no real title available?)
- Improved approximation algorithms for index coding
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
- Index Coding With Side Information
- Kernelization for orthogonality dimension
- Kernelization. Theory of parameterized preprocessing
- Linear Programming Approximations for Index Coding
- On the Hardness of Approximating the Network Coding Capacity
- Optimal Index Codes With Near-Extreme Rates
- Orthogonal representations over finite fields and the chromatic number of graphs
- Parameterized algorithms
- Set partitioning via inclusion-exclusion
- Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate
- Storage Capacity of Repairable Networks
This page was built for publication: Kernels for storage capacity and dual index coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968030)
