2 papers
cs.CC2025
Parameterized Complexity of Segment Routing
Cristina Bazgan, Morgan Chopin, André Nichterlein +1
Segment Routing is a recent network technology that helps optimizing network throughput by providing finer control over the routing paths. Instead of routing directly from a source…
cs.DS2024
SpiderDAN: Matching Augmentation in Demand-Aware Networks
Aleksander Figiel, Darya Melnyk, André Nichterlein +2
Graph augmentation is a fundamental and well-studied problem that arises in network optimization. We consider a new variant of this model motivated by reconfigurable communication…