The authors obtain an O(log m)-approximation for the coverage problem (tight, as it generalizes set cover) and the first non-trivial O(log² m)-approximation for the connectivity problem via LP relaxation and randomized rounding.
Flow problems in multi- interface networks.IEEE Transactions on Computers, 63:361–374
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 7roles
background 1polarities
background 1representative citing papers
UIFO is a new scheduling model that adds class-level dynamic reordering to programmable hardware while generalizing PIFO and PIEO and sustaining 100 Gbps line rate.
Initial coverage rate grows with more agents n, but if speed scales with footprint area then a single agent performs best overall while equal performance holds if speed scales with radius.
NanoTag enables byte-granular overflow detection on unmodified MTE binaries by combining hardware tagging with selective software tripwire checks on the Scudo allocator.
Three scheduling strategies for hybrid quantum-HPC systems cut classical resource use by up to 64% or boost QPU utilization depending on workload balance, validated on real hardware.
A constrained NMF framework disaggregates national grid load data into identifiable residential, services, and industrial components whose monthly estimates match reported statistics.
SEADA introduces an analytical framework combining cost models, mapping tools, and entropy-based precision selection to optimize mixed-precision DNNs on multi-precision spatial architectures.
citing papers explorer
-
Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks
The authors obtain an O(log m)-approximation for the coverage problem (tight, as it generalizes set cover) and the first non-trivial O(log² m)-approximation for the connectivity problem via LP relaxation and randomized rounding.
-
Programmable Packet Scheduling with Dynamic Reordering at Line Rate
UIFO is a new scheduling model that adds class-level dynamic reordering to programmable hardware while generalizing PIFO and PIEO and sustaining 100 Gbps line rate.
-
Split over $n$ resource sharing problem: Are fewer capable agents better than many simpler ones?
Initial coverage rate grows with more agents n, but if speed scales with footprint area then a single agent performs best overall while equal performance holds if speed scales with radius.
-
NanoTag: Systems Support for Efficient Byte-Granular Overflow Detection on ARM MTE
NanoTag enables byte-granular overflow detection on unmodified MTE binaries by combining hardware tagging with selective software tripwire checks on the Scudo allocator.
-
Three ways to share a QPU: Scheduling strategies for hybrid Quantum-HPC applications
Three scheduling strategies for hybrid quantum-HPC systems cut classical resource use by up to 64% or boost QPU utilization depending on workload balance, validated on real hardware.
-
A Blind Source Separation Framework to Monitor Sectoral Power Demand from Grid-Scale Load Measurements
A constrained NMF framework disaggregates national grid load data into identifiable residential, services, and industrial components whose monthly estimates match reported statistics.
-
SEADA: An efficient methodology for optimizing mixed-precision DNNs on multi-precision spatial architectures
SEADA introduces an analytical framework combining cost models, mapping tools, and entropy-based precision selection to optimize mixed-precision DNNs on multi-precision spatial architectures.