480 research outputs found
Inapproximability of Combinatorial Optimization Problems
We survey results on the hardness of approximating combinatorial optimization
problems
Formal Scheduling Constraints for Time-Sensitive Networks
In recent years, the IEEE 802.1 Time Sensitive Networking (TSN) task group
has been active standardizing time-sensitive capabilities for Ethernet networks
ranging from distributed clock synchronization and time-based ingress policing
to frame preemption, redundancy management, and scheduled traffic enhancements.
In particular the scheduled traffic enhancements defined in IEEE 802.1Qbv
together with the clock synchronization protocol open up the possibility to
schedule communication in distributed networks providing real-time guarantees.
In this paper we formalize the necessary constraints for creating
window-based IEEE~802.1Qbv Gate Control List schedules for Time-sensitive
Networks (TSN). The resulting schedules allow a greater flexibility in terms of
timing properties while still guaranteeing deterministic communication with
bounded jitter and end-to-end latency
Ising formulations of many NP problems
We provide Ising formulations for many NP-complete and NP-hard problems,
including all of Karp's 21 NP-complete problems. This collects and extends
mappings to the Ising model from partitioning, covering and satisfiability. In
each case, the required number of spins is at most cubic in the size of the
problem. This work may be useful in designing adiabatic quantum optimization
algorithms.Comment: 27 pages; v2: substantial revision to intro/conclusion, many more
references; v3: substantial revision and extension, to-be-published versio
- …