Loading...
Search for:
following-problem
0.005 seconds
Using shortcut edges to maximize the number of triangles in graphs
, Article Operations Research Letters ; Volume 43, Issue 6 , November , 2015 , Pages 586-591 ; 01676377 (ISSN) ; Fazli, M. A ; Habibi, J ; Yazdanbod, S ; Sharif University of Technology
Elsevier
2015
Abstract
In this paper, we consider the following problem: given an undirected graph G=(V,E) and an integer k, find I⊆V2 with |I|≤k in such a way that G'=(V,E∪I) has the maximum number of triangles (a cycle of length 3). We first prove that this problem is NP-hard and then give an approximation algorithm for it
The maximum disjoint routing problem
, Article 22nd International Conference on Computing and Combinatorics, COCOON 2016, 2 August 2016 through 4 August 2016 ; Volume 9797 , 2016 , Pages 319-329 ; 03029743 (ISSN); 9783319426334 (ISBN) ; Sharif Zadeh, A. S ; Zarrabi Zadeh, H ; Sharif University of Technology
Springer Verlag
2016
Abstract
Motivated by the bus escape routing problem in printed circuit boards, we revisit the following problem: given a set of n axis-parallel rectangles inside a rectangular region R, find the maximum number of rectangles that can be extended toward the boundary of R, without overlapping each other. We provide an efficient algorithm for solving this problem in O(n2 log3 n log log n) time, improving over the current best O(n3)-time algorithm available for the problem