Sciweavers

193 search results - page 27 / 39
» The Capacitated m-Ring-Star Problem
Sort
View
ASPDAC
1998
ACM
79views Hardware» more  ASPDAC 1998»
14 years 20 days ago
Simultaneous Wire Sizing and Wire Spacing in Post-Layout Performance Optimization
- In this paper, we study the wire sizing and wire spacing problem for post-layout performance optimization under Elmore delay model. Both ground capacitance and coupled capacitanc...
Jiang-An He, Hideaki Kobayashi
APPROX
2005
Springer
150views Algorithms» more  APPROX 2005»
14 years 2 months ago
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
Julián Mestre
ATMOS
2008
103views Optimization» more  ATMOS 2008»
13 years 10 months ago
IP-based Techniques for Delay Management with Priority Decisions
Delay management is an important issue in the daily operations of any railway company. The task is to update the planned timetable to a disposition timetable in such a way that the...
Michael Schachtebeck, Anita Schöbel
MJ
2007
87views more  MJ 2007»
13 years 8 months ago
Using SAT-based techniques in power estimation
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
Assim Sagahyroon, Fadi A. Aloul
TALG
2010
123views more  TALG 2010»
13 years 6 months ago
Lower-bounded facility location
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
Zoya Svitkina