Back to Results
First PageMeta Content
Binary trees / Applied mathematics / R-tree / Dynamic programming / Equations / Systems engineering / B-tree / Linear programming / Tango tree / Mathematics / Operations research / Graph theory


A Linear Time Algorithm for Optimum Tree Placement Satrajit Chatterjee Zile Wei Alan Mishchenko Robert Brayton Department of EECS U. C. Berkeley {satrajit, zile, alanmi, brayton}@eecs.berkeley.edu
Add to Reading List

Document Date: 2007-04-23 22:39:34


Open Document

File Size: 274,31 KB

Share Result on Facebook

Company

ABC / MIT Press / Altera / AIG / Intel / /

/

IndustryTerm

incremental placement algorithm / polynomial algorithm / logic network / polynomial-time algorithms / affected sub-network / linear programming algorithm / technology mapping / linear time algorithm / linear-time median algorithm / pass algorithm / sub-network / simultaneous technology mapping / placement-aware technology / technology mapping algorithm / dynamic programming algorithm / sub-networks / optimum placement algorithm / http /

OperatingSystem

Linux / GNU / /

Organization

Optimum Tree Placement Satrajit Chatterjee Zile Wei Alan Mishchenko Robert Brayton Department / MIT / LP DP / /

Person

Wei Alan Mishchenko Robert Brayton / /

Technology

tree placement algorithm / two pass algorithm / optimum placement algorithm / incremental placement algorithm / proposed algorithm / Linux / polynomial-time algorithms / linear programming algorithm / 3.2 Tree Placement Algorithm / two algorithm / median algorithm / dynamic programming algorithm / The algorithm / linear time algorithm / Xeon 3.06GHz processor / placement-aware technology / technology mapping algorithm / linear-time median algorithm / DP algorithm / polynomial algorithm / /

URL

http /

SocialTag