Filters








6,595 Hits in 11.2 sec

Centrality of trees for capacitated $$k$$ k -center

Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson
2015 Mathematical programming  
Our concept of tree instances is versatile and applies to natural variants of the capacitated k-center problem for which we also obtain improved algorithms.  ...  We consider the capacitated k-center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity.  ...  Acknowledgements The authors thank the anonymous reviewers of a preliminary version [1] of this paper for their helpful comments.  ... 
doi:10.1007/s10107-014-0857-y fatcat:dwyi3z7ctjchnnn77klf3ksibu

Centrality of Trees for Capacitated k-Center [article]

Hyung-Chan An, Aditya Bhaskara, Ola Svensson
2013 arXiv   pre-print
Our concept of tree instances is quite versatile, and applies to natural variants of the capacitated k-center problem for which we also obtain improved algorithms.  ...  For the capacitated k-center problem, we give a simple algorithm with a clean analysis that allows us to prove an approximation guarantee of 9.  ...  There exists a 9-approximation algorithm for the capacitated k-center problem.  ... 
arXiv:1304.2983v1 fatcat:epdf4g7snjcs7lwebzulusqmxa

Centrality of Trees for Capacitated k-Center [chapter]

Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson
2014 Lecture Notes in Computer Science  
Our concept of tree instances is versatile and applies to natural variants of the capacitated k-center problem for which we also obtain improved algorithms.  ...  We consider the capacitated k-center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity.  ...  Acknowledgements The authors thank the anonymous reviewers of a preliminary version [1] of this paper for their helpful comments.  ... 
doi:10.1007/978-3-319-07557-0_5 fatcat:ewv5fsig45d2vixjqi2dhyz3qq

Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem

Eduardo Uchoa, Túlio A. M. Toffolo, Mauricio C. de Souza, Alexandre X. Martins, Ricardo Fukasawa
2011 Networks  
We propose efficient algorithms to compute tight lower bounds and high quality upper bounds for the Multi-Level Capacitated Minimum Spanning Tree problem.  ...  We first develop a branch-andcut algorithm for the problem. This algorithm is able to solve instances of medium size and to provide tight lower bounds for larger ones.  ...  Introduction The Multi-Level Capacitated Minimum Spanning Tree (MLCMST) problem is an extension of the wellknown Capacitated Minimum Spanning Tree (CMST) problem (for a comprehensive survey on the CMST  ... 
doi:10.1002/net.20485 fatcat:jkp7zh5ppzfe5cw457ghkjtw44

Gated clock routing for low-power microprocessor design

Jaewon Oh, M. Pedram
2001 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
to reduce the switched capacitance of the clock tree.  ...  We construct a clock tree topology based on the locations and the activation frequencies of the modules, while the locations of the internal nodes of the clock tree (and hence the masking gates) are determined  ...  If we divide the chip into k equal sized partitions (where k is a power of two), then each partition has G/k gates and the average (a) one centralized controller vs.  ... 
doi:10.1109/43.924825 fatcat:ema666maivdyrnpzpkvidnbch4

Constant Factor Approximation for Capacitated k-Center with Outliers [article]

Tomasz Kociumaka, Marek Cygan
2014 arXiv   pre-print
[SODA'01] presented a 3-approximation for the k-center problem with outliers.  ...  In this paper we consider a common generalization of the two extensions previously studied separately, i.e. we work with the capacitated k-center with outliers.  ...  Acknowledgements We would like to thank Samir Khuller for suggesting the study of this variant of the k-center problem and helpful discussions.  ... 
arXiv:1401.2874v1 fatcat:7s74fs7ivrfktputlcjxzd6u3y

Low-Power Clock Tree Synthesis for 3D-ICs

Tiantao Lu, Ankur Srivastava
2017 ACM Transactions on Design Automation of Electronic Systems  
We develop a two-phase clock tree synthesis design flow for 3D-ICs: (1) 3D abstract clock tree generation based on K-means clustering and (2) clock tree embedding with simultaneous shutdown gates' insertion  ...  We propose efficient algorithms to construct a low-power clock tree for through-silicon-via (TSV)-based 3D-ICs.  ...  In a 3D clock tree, clock TSVs deliver clock signals from the clock source to each of the clock sinks, while control TSVs provide shutdown signals from a centralized control center to all shutdown gates  ... 
doi:10.1145/3019610 fatcat:ohz5dsyhtrcmjjyja5qhpdhlbq

Capacitated Center Problems with Two-Sided Bounds and Outliers [article]

Hu Ding, Lunjia Hu, Lingxiao Huang, Jian Li
2017 arXiv   pre-print
For the case of opening exactly k centers, we note that a generalization of a recent LP approach can achieve constant factor approximation algorithms for our problems.  ...  In recent years, the capacitated center problems have attracted a lot of research interest.  ...  There is a polynomial time 25-approximation algorithm for the (L,{U u },k,p)-Center problem and the (L,{U u },soft-k,p)-Center problem.  ... 
arXiv:1702.07435v1 fatcat:o77jnikykveldczi56tmwva3ke

Robust Clock Tree Routing in the Presence of Process Variations

U. Padmanabhan, J.M. Wang, J. Hu
2008 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
The algorithm achieves the improvement by the following ways: 1) choosing the best center measure which is dynamically based on the first three moments of the skew distribution and 2) designing for all  ...  Experiments on benchmark circuits demonstrate that the proposed method reduces the number of skew violations by 12%-37%.  ...  Similarly, c Li represents the load capacitance at node i. For a general tree, let T be the set of all tree edges and T (i) be the set of tree edges at the downstream of edge i.  ... 
doi:10.1109/tcad.2008.925776 fatcat:uddqxgo7abgxxohg7q7rxwsre4

Decreasing the Power-Clock Resonant Signal Central Voltage as a Mean for Power Reduction in Integrated Power and Clock Distribution Networks

Seyed E Esmaeili, American University of Kuwait, Safat, 13034, Salmiya, Kuwait, Abeer Imdoukh
2021 Indian Journal of Science and Technology  
Discussion: The IPCDN has a large capacitance and is heavily loaded, thus reducing the central voltage of the resonant sinusoidal signal flowing in this network enables significant reduction in power consumption  ...  This study discusses potential power savings in IPCDNs achieved by reducing the central voltage at which the signal oscillates.  ...  Acknowledgement This research was funded by the American University of Kuwait.  ... 
doi:10.17485/ijst/v14i33.1820 fatcat:ekj3ng4gerhwdjipbutgqf343a

Modeling and Practical Evaluation of a Service Location Problem in Large Scale Networks

Olivier Beaumont, Nicolas Bonichon, Hubert Larchevêque
2011 2011 International Conference on Parallel Processing  
We show how to turn an approximation algorithm for BPDC into an approximation algorithm for the non-uniform capacitated K-center problem and vice-versa.  ...  diameter at most βdmax, for β > 1, to the optimal number of bins of diameter at most dmax.  ...  Let K(K) = (S, d, w, K) be an instance of nonuniform capacitated K-center, based on the same set of weighted elements, for any positive value K.  ... 
doi:10.1109/icpp.2011.36 dblp:conf/icpp/BeaumontBL11 fatcat:5nytw3vbj5fb3epzjuysjulwqu

Modeling of the Capacitated Single Allocation Hub Location Problem with a Hierarchical Approch (TECHNICAL NOTE)

2014 International Journal of Engineering  
By utilizing these problems, the present paper attempts to allocate "capacitated" option to each provider service and consequently establish and choose the best possible condition, so that demands centers  ...  are rationally and effectively guided by service providers' centers and their request never remains without response.  ...  [20] presented the Tree of Hubs Location Problem.  ... 
doi:10.5829/idosi.ije.2014.27.04a.08 fatcat:sqveqrebuzdn3oczzhb2kfoipq

Wood allocation trade‐offs between fiber wall, fiber lumen and axial parenchyma drive drought resistance in neotropical trees

Thomas A.J. Janssen, Teemu Hölttä, Katrin Fleischer, Kim Naudts, A. Han Dolman
2019 Plant, Cell and Environment  
Dominant tree taxa from wet forests prioritize xylem allocation to axial parenchyma at the expense of fiber walls, resulting in a low embolism resistance for a given wood density and a high vulnerability  ...  We analyzed published data of xylem traits, hydraulic properties and measures of drought resistance from neotropical tree species retrieved from 346 sources.  ...  This suggests that wood density is a weak proxy of K s in neotropical tree taxa. Sapwood capacitance also declined with increasing wood density in both wet and dry taxa (Figure 3b ).  ... 
doi:10.1111/pce.13687 pmid:31760666 fatcat:dsmw54h3srenbhp7ipcid3xe5m

Performance optimization of VLSI interconnect layout

Jason Cong, Lei He, Cheng-Kok Koh, Patrick H. Madden
1996 Integration  
clock nets, non-tree clock routing, and clock schedule optimization.  ...  This paper presents a comprehensive survey of existing techniques for interconnect optimization during the VLSI physical design process, with emphasis on recent studies on interconnect design and optimization  ...  ,N, where CL is the total load of the center tree.  ... 
doi:10.1016/s0167-9260(96)00008-9 fatcat:jt7444lufzaf5hxi7vg22qvvue

Stationary patterns in star networks of bistable units: Theory and application to chemical reactions

Nikos E. Kouvaris, Michael Sebek, Albert Iribarne, Albert Díaz-Guilera, István Z. Kiss
2017 Physical review. E  
activation of the network is pinned, but the peripheral activation propagates toward the center.  ...  The experiments confirm the existence of the stationary spatial patterns and the dependence of coupling strength on the number of peripheral elements for transitions between pinned and retreating or spreading  ...  Central node forced to the active state FIG. 2 : 2 Forced active center: Bifurcation diagrams and simulations. (a) The function g(1, v; K) is plotted for three different values of K.  ... 
doi:10.1103/physreve.95.042203 pmid:28505836 fatcat:7cbcehtyr5gevgy4v4lkpn7igy
« Previous Showing results 1 — 15 out of 6,595 results