Filters








531,843 Hits in 5.0 sec

On the computational complexity of upper total domination

Qizhi Fang
2004 Discrete Applied Mathematics  
Upper total domination number t (G) is the maximum cardinality over all minimal total dominating sets of G, and upper fractional total domination number t (G) is the maximum weight over all minimal total  ...  the problems of computing t (G) and t (G) are both NP-complete. ?  ...  We remark another related parameter-total domination number t (G), the cardinality of a smallest total dominating set of G. Its computational complexity has been much studied in [1, 2, 7, 8] .  ... 
doi:10.1016/s0166-218x(03)00195-1 fatcat:iljvbs6emnfl7fzvafq57ostwq

On the use of flow dominance in complexity measures for facility layout problems

W. HERROELEN, A. VAN GILS
1985 International Journal of Production Research  
cular layout configuration (1 or process layout) to s paper cri ally examines past contributions and casts some doubts on the val ty of.the flow dominance concept and the related measures of layout complexity  ...  Various authors propose the use of flow dominance in complexity ratings to evaluate the comp of facilities 1 problems, to determine the choice between and visual based methods for plant layout, and to  ...  In the next section we g1ve the formal definition of flow dominance, elaborate on the computation of lower and upper bounds to the flow dominance value and discuss the implications tions which found way  ... 
doi:10.1080/00207548508904693 fatcat:3rfgii5shnhbtl72zqwhf4gjru

Maximizing Sharing of Protected Information

Steven Dawson, Sabrina De Capitani di Vimercati, Patrick Lincoln, Pierangela Samarati
2002 Journal of computer and system sciences (Print)  
Second, despite the large body of literature on the topic and the proposal of several models for multilevel database systems [14, 16, 23, 26, 36] , the lack of support for expressing and combating inference  ...  We address the problem of computing security classifications to be assigned to information in a database system, while reflecting both explicit classification requirements and necessary classification  ...  Otherwise, is complex, and is called to compute a minimal level that must dominate (accounting for the current levels of the other attributes on the left-hand side of the constraint) and still satisfy  ... 
doi:10.1006/jcss.2001.1807 fatcat:3gxdo7odqnhu7oeiq5cctqnw7y

Page 4749 of Mathematical Reviews Vol. , Issue 92i [page]

1992 Mathematical Reviews  
is the largest sum of a minimal total dominating function. We determine the computational complexity of these parameters, give conditions under which I?  ...  The upper total domination number I; is the largest size of a minimal total dominating set.  ... 

Sorting and Selection in Posets

Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin
2011 SIAM journal on computing (Print)  
We also describe a variant of Mergesort with query complexity O(wn log n w ) and total complexity O(w 2 n log n w ); an algorithm with the same query complexity was given by Faigle and Turán, but no efficient  ...  In particular, we present the first algorithm that sorts a width-w poset of size n with optimal query complexity O(n(w + log n)).  ...  Acknowledgments We thank Mike Saks for the reference to [9] .  ... 
doi:10.1137/070697720 fatcat:ejhc3uvpdzayrcwe7w5k4hjise

Optimal Jumper Insertion for Antenna Avoidance Considering Antenna Charge Sharing

Jia Wang, Hai Zhou
2007 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
The antenna ratio of total exposed antenna area to total gate oxide area is directly related to the amount of damage.  ...  The time complexity is O(α|V | 2 ) and the space complexity is O(|V | 2 ), where |V | is the number of nodes in the routing tree and α is a factor depending on how to find a nonblocked position on a wire  ...  Using a small upper bound on the total exposed antenna area would overconstrain the routing, while using a large upper bound on the total exposed antenna area would result in a huge number of wire segments  ... 
doi:10.1109/tcad.2007.893551 fatcat:5ypanuykv5fblkmuecfgakgc7e

Sorting and Selection in Posets [chapter]

Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin
2009 Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms  
We also describe a variant of Mergesort with query complexity O(wn log n w ) and total complexity O(w 2 n log n w ); an algorithm with the same query complexity was given by Faigle and Turán, but no efficient  ...  In particular, we present the first algorithm that sorts a width-w poset of size n with optimal query complexity O(n(w + log n)).  ...  Acknowledgments We thank Mike Saks for the reference to [9] .  ... 
doi:10.1137/1.9781611973068.44 fatcat:kil4vzenarcutflw4q5ueis4ga

Page 522 of The Journal of the Operational Research Society Vol. 50, Issue 5 [page]

1999 The Journal of the Operational Research Society  
The total transportation distance obtained by the heuristic can be used as an upper bound.  ...  Procedure 2 (branch and bound algorithm) Step 1 Eliminate dominated candidates for each I/O point. Compute lower and upper bounds of the root node. If the two bounds are equal, stop.  ... 

Optimal jumper insertion for antenna avoidance under ratio upper-bound

Jia Wang, Hai Zhou
2006 Proceedings of the 43rd annual conference on Design automation - DAC '06  
The antenna ratio of total exposed antenna area to total gate oxide area is directly related to the amount of damage.  ...  The time complexity is O(α|V | 2 ) and the space complexity is O(|V | 2 ), where |V | is the number of nodes in the routing tree and α is a factor depending on how to find a non-blocked position on a wire  ...  The algorithm processes one edge at a time by combining two trees with an unprocessed edge and computing the dominant partial solutions of the new tree based on those of the two old trees.  ... 
doi:10.1145/1146909.1147102 dblp:conf/dac/WangZ06 fatcat:2ig6lsmornfh5asbd6j3zi4sdq

Optimal jumper insertion for antenna avoidance under ratio upper-bound

Jia Wang, Hai Zhou
2006 Proceedings - Design Automation Conference  
The antenna ratio of total exposed antenna area to total gate oxide area is directly related to the amount of damage.  ...  The time complexity is O(α|V | 2 ) and the space complexity is O(|V | 2 ), where |V | is the number of nodes in the routing tree and α is a factor depending on how to find a non-blocked position on a wire  ...  The algorithm processes one edge at a time by combining two trees with an unprocessed edge and computing the dominant partial solutions of the new tree based on those of the two old trees.  ... 
doi:10.1109/dac.2006.229322 fatcat:vd2dm3ln25adnfq6xjhacfu3ha

A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem

F Della Croce, V T'kindt
2002 Journal of the Operational Research Society  
O We will see later that Property 4 affects the computational complexity of the proposed heuristic procedure. Upper bound We apply the PRTF and APRTF rules proposed by Chu!  ...  For each selected branch: (a) Compute lower bound LB and upper bound UB of the optimal solution value for that branch. IF UB <z THEN z=UB.  ... 
doi:10.1057/palgrave.jors.2601389 fatcat:effciqwphzfrfg4e2qdze4uduq

A Box Decomposition Algorithm to Compute the Hypervolume Indicator [article]

Renaud Lacour, Kathrin Klamroth, Carlos M. Fonseca
2015 arXiv   pre-print
We propose a new approach to the computation of the hypervolume indicator, based on partitioning the dominated region into a set of axis-parallel hyperrectangles or boxes.  ...  While the theoretical complexity of such a method is lower bounded by the complexity of the partition, which is, in the worst-case, larger than the best upper bound on the complexity of the hypervolume  ...  an upper bound on the complexity of computing N , c 1 and c 2 being constants with respect to n and n .  ... 
arXiv:1510.01963v2 fatcat:uwdiouomajfhplzfjbl2caay2m

Overall Complexity Certification of a Standard Branch and Bound Method for Mixed-Integer Quadratic Programming [article]

Shamisa Shoja, Daniel Arnström, Daniel Axehill
2022 arXiv   pre-print
This paper presents a method to certify the computational complexity of a standard Branch and Bound method for solving Mixed-Integer Quadratic Programming (MIQP) problems defined as instances of a multi-parametric  ...  Beyond previous work, not only the size of the binary search tree is considered, but also the exact complexity of solving the relaxations in the nodes by using recent result from exact complexity certification  ...  ACKNOWLEDGMENT This work was partially supported by the Wallenberg AI, Autonomous Systems and Software Program (WASP) funded by the Knut and Alice Wallenberg Foundation.  ... 
arXiv:2204.02171v1 fatcat:xlu6oa7vsrduvmxm6sqpsm22ty

Multi-Objective Optimization, different approach to query a database [article]

Matteo Cordioli
2022 arXiv   pre-print
Moreover, it's explained the core idea behind the Prioritized and Flexible skyline. In the end, the pros and cons of each type of analyzed query have been evaluated based on different criteria.  ...  The datasets available nowadays are very rich and complex, but how do we reach the information we are looking for?  ...  Once all the predicate scores are computed, it's possible to compute the total score of current tuples. An upper bound T is maintained for the overall score of unseen objects.  ... 
arXiv:2202.01550v1 fatcat:kyejdy6r75h3bj64swbl7gb7oa

Algorithmic Aspects of Upper Domination: A Parameterised Perspective [chapter]

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2016 Lecture Notes in Computer Science  
This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph, with a focus on parameterised complexity.  ...  The study of structural properties also yields some insight into Upper Total Domination. We further consider graphs of bounded degree and derive upper and lower bounds for kernelisation.  ...  We would like to thank our colleagues Serge Gaspers, David Manlove and Daniel Meister for some discussions on (total) upper domination.  ... 
doi:10.1007/978-3-319-41168-2_10 fatcat:mrlqhxbadjaethbdsxqptjvexq
« Previous Showing results 1 — 15 out of 531,843 results