No article text was recorded for this version.
NP-completeness of traffic grooming
Version 1 of 125 papers40 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Static and dynamic low-congested interval routing schemes
- Blog: Approximating the traffic grooming problem in tree and star networks
- Blog: On the Resilience of Bipartite Networks
- Blog: Static and Dynamic Low-Congested Interval Routing Schemes
- Blog: The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation
- Blog: Asymptotically Optimal Algorithms for One-to-One Pickup and Delivery Problems With Applications to Transportation Systems
- Blog: Edge-based traffic engineering for OSPF networks
- Blog: Algorithms for Routing an Unmanned Aerial Vehicle in the Presence of Refueling Depots
- Blog: Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Blog: Efficiently Finding Simple Schedules in Gaussian Half-Duplex Relay Line Networks
- Blog: Route oscillations in I-BGP with route reflection
- Blog: Network lifetime maximization for time-sensitive data gathering in wireless sensor networks
- Blog: Online oblivious routing
- Blog: On Routing Optimization in Networks With Embedded Computational Services
- Blog: Routing complexity of faulty networks
- Blog: Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis
- Blog: S*: A Heuristic Information-Based Approximation Framework for Multi-Goal Path Finding
- Blog: Node-Constrained Traffic Engineering: Theory and Applications
- Blog: Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis
- Blog: Utility-aware Payment Channel Network Rebalance
- Blog: Throughput Optimal Routing in Blockchain-Based Payment Systems
- Blog: GADMM: Fast and Communication Efficient Framework for Distributed Machine Learning
- Blog: Routage efficace en énergie
- Blog: The Thinnest Path Problem
- Blog: Metaheuristic Approaches to Traffic Grooming in Wdm Optical Networks
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_np_completeness_of_traffic_grooming_351aec6d,
title = {NP-completeness of traffic grooming},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/np-completeness-of-traffic-grooming/rdr_351aec6d9ec44498a3d1d89a8ac7e91b},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_np_completeness_of_traffic_grooming_351aec6d_v1,
title = {NP-completeness of traffic grooming},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/np-completeness-of-traffic-grooming/rdr_351aec6d9ec44498a3d1d89a8ac7e91b/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}