Cluster before you hallucinate: node-capacitated network design and energy efficient routing
From MaRDI portal
Publication:6550988
DOI10.1137/20M1360645zbMATH Open1541.68445MaRDI QIDQ6550988
Kirk R. Pruhs, Viswanath Nagarajan, Cliff Stein, Ravishankar Krishnaswamy
Publication date: 5 June 2024
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On fixed cost \(k\)-flow problems
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- On the single-source unsplittable flow problem
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- A survey on Benders decomposition applied to fixed-charge network design problems
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- The geometry of graphs and some of its algorithmic applications
- Approximability of capacitated network design
- Random sampling in cut, flow, and network design problems
- Detecting high log-densities
- Spectral Sparsification of Graphs
- Buy-at-Bulk Network Design with Protection
- Minimum-Cost Network Design with (Dis)economies of Scale
- Approximation via cost sharing
- (Almost) Tight bounds and existence theorems for single-commodity confluent flows
- A Constant Factor Approximation for the Single Sink Edge Installation Problem
- Solving Optimization Problems with Diseconomies of Scale via Decoupling
- A General Approximation Technique for Constrained Forest Problems
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- Multicast Routing for Energy Minimization Using Speed Scaling
- Algorithms for Hub Label Optimization
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency
- Hallucination Helps: Energy Efficient Virtual Circuit Routing
- Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
- Steiner Tree Approximation via Iterative Randomized Rounding
- A general framework for graph sparsification
- Hardness of the Undirected Congestion Minimization Problem
- The dense \(k\)-subgraph problem
This page was built for publication: Cluster before you hallucinate: node-capacitated network design and energy efficient routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550988)