Register loading via linear programming
From MaRDI portal
Publication:494793
DOI10.1007/S00453-014-9888-2zbMATH Open1327.90101OpenAlexW2064543480MaRDI QIDQ494793FDOQ494793
Authors: Minming Li, Gruia Calinescu 
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
Recommendations
Linear programming (90C05) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Multiway cuts in node weighted graphs
- Title not available (Why is that?)
- Approximation Algorithms for Directed Steiner Problems
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- An approximation algorithm for the register allocation problem
- A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
- Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- All structured programs have small tree width and good register allocation
- Approximating directed multicuts
- Improved approximation for directed cut problems
- Title not available (Why is that?)
- The allocation problem in hardware design
- Register Allocation in Structured Programs
- Title not available (Why is that?)
- On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
Cited In (3)
This page was built for publication: Register loading via linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494793)
