Pages that link to "Item:Q2999327"

The following pages link to Theory and Practice of Algorithms in (Computer) Systems (Q2999327):

Displaying 22 items.

• Speed Scaling to Manage Temperature (Q2999328) (← links)
• Alternative Route Graphs in Road Networks (Q2999330) (← links)
• Robust Line Planning in Case of Multiple Pools and Disruptions (Q2999331) (← links)
• Exact Algorithms for Intervalizing Colored Graphs (Q2999332) (← links)
• L(2,1)-Labeling of Unigraphs (Q2999333) (← links)
• Energy-Efficient Due Date Scheduling (Q2999335) (← links)
• Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves (Q2999336) (← links)
• A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs (Q2999337) (← links)
• Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs (Q2999338) (← links)
• On Greedy and Submodular Matrices (Q2999339) (← links)
• MIP Formulations for Flowshop Scheduling with Limited Buffers (Q2999340) (← links)
• A Scenario-Based Approach for Robust Linear Optimization (Q2999341) (← links)
• Conflict Propagation and Component Recursion for Canonical Labeling (Q2999342) (← links)
• 3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size (Q2999343) (← links)
• Improved Taxation Rate for Bin Packing Games (Q2999344) (← links)
• Multi-channel Assignment for Communication in Radio Networks (Q2999345) (← links)
• Computing Strongly Connected Components in the Streaming Model (Q2999346) (← links)
• Improved Approximation Algorithms for the Max-Edge Coloring Problem (Q2999347) (← links)
• New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches (Q2999348) (← links)
• An Approximative Criterion for the Potential of Energetic Reasoning (Q2999349) (← links)
• Speed Scaling for Energy and Performance with Instantaneous Parallelism (Q2999350) (← links)
• Algorithms for Scheduling with Power Control in Wireless Networks (Q2999351) (← links)