BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260730T152640Z
LOCATION:Exhibit Hall
DTSTART;TZID=America/Los_Angeles:20260728T173600
DTEND;TZID=America/Los_Angeles:20260728T173700
UID:dac_DAC 2026_sess306_LBR019@linklings.com
SUMMARY:Late Breaking Results: A Fully Differentiable Rectilinear Minimum 
 Spanning Tree Wirelength Model for Global Placement
DESCRIPTION:Fuxing Huang, Hao Wu, Junhong Li, and Qiyuan Chen (Southeast U
 niversity); Wenxing Zhu (Fuzhou University); xinning liu (southeast univer
 sity); and Ziran Zhu (School of Integrated Circuits, Southeast University)
 \n\nGlobal placement relies heavily on differentiable wirelength models to
  guide the optimization process. While the half-perimeter wirelength is go
 ld standard due to its computational efficiency and smooth approximations,
  it suffers from a significant fidelity gap as it fails to capture the int
 ernal routing topology of multi-pin nets. In this paper, we propose a nove
 l differentiable wirelength model based on the rectilinear minimum spannin
 g tree (RMST). By leveraging the matrix-tree theorem and the log-sum-exp f
 unction, we transform the combinatorial RMST problem into a smooth, contin
 uous objective suitable for global placement. Experimental results demonst
 rate that our model significantly reduces the fidelity gap, achieving a 3.
 4% reduction in RMST wirelength and a 3.2% reduction in routed wirelength 
 compared to the widely used HPWL-based baseline, while maintaining accepta
 ble runtime.\n\nTrack: Student\n\n
END:VEVENT
END:VCALENDAR