Register loading via linear programming

DOI10.1007/s00453-014-9888-2zbMath1327.90101OpenAlexW2064543480MaRDI QIDQ494793

Minming Li, Gruia Călinescu

Publication date: 2 September 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-014-9888-2

zbMATH Keywords

linear programmingrandomized roundingbank selectionregister allocation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
• A series of approximation algorithms for the acyclic directed Steiner tree problem
• All structured programs have small tree width and good register allocation
• The allocation problem in hardware design
• Approximating directed multicuts
• Improved approximation for directed cut problems
• An approximation algorithm for the register allocation problem
• Register Allocation in Structured Programs
• Multiway cuts in node weighted graphs
• Fast Approximation Algorithms for Fractional Packing and Covering Problems
• Approximation Algorithms for Directed Steiner Problems
• A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
• On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes