Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 12 of 12 for “"max cut"”.
-
Improving the smoothed complexity of flip for max cut problems
Finding locally optimal solutions for max-cut and max-k-cut are well-known PLS-complete problems. An instinctive approach to finding such a locally optimum solution is the FLIP method. Even though FLIP requires exponential time in worst-case instances, it tends to terminate quickly in practical …
-
Decay of correlations and inference in graphical models
… on graphs, [upper case letter g in italic] The MAX-CUT problem on graphs with random edge deletions, and 3) Low Rank Matrix Completion from an incomplete subset of its entries. For each problem, we analyze the conditions under which either spatial or temporal decay of correlations exists and …
-
Physical Design for Multichip Modules
… and layer assignment. The emphasis is on maximizing the electrical performance, based on accurate modeling of MCM interconnect behavior. A new approach, called Reciprocal Expansion, is developed for rapidly estimating the time-domain response of lossy coupled MCM interconnect structures, …
-
Four Problems in Probability and Optimization
… we consider the $K_i$-cover problem and the max cut problem. We show that a family of facets arising from $K_i$-$p$-holes is valid on the $i/2$ theta body. We also prove an integrality gap of $1/2$ for the triangle free problem, and show that at least $n/2$ steps are required for the triangle …
-
Algoritmos para resolução do problema do corte máximo : abordagem exata e meta-heurísticas
… arestas que conectam os dois subconjuntos seja maximizada. Apesar da simplicidade da sua definição, o problema do corte máximo é NP-Completo, sendo classificado também como NP- Difícil, ou seja, uma classe de problemas para a qual, até o momento, não foi definido um método para encontrar uma …
-
ΤΕΧΝΙΚΕΣ ΣΧΕΔΙΑΣΜΟΥ ΠΑΡΑΛΛΗΛΩΝ ΑΛΓΟΡΙΘΜΩΝ ΚΑΙ Η ΕΦΑΡΜΟΓΗ ΤΟΥΣ ΣΕ ΠΡΟΒΛΗΜΑΤΑ ΓΡΑΦΩΝ
… SOLUTION FOR THE ENUMERATION VERSION OF THE MAX CUT PROBLEM. 3. COLORING OF RANDOM GRAPHS.
-
Metaheurísticas aplicadas al problema de compilación de circuitos cuánticos
… Algorithm (QAOA) para resolver problemas Max-Cut. En la literatura, este problema se ha modelado tanto en forma de planning como de scheduling con minimización del makespan. Algunos de los métodos presentes en la literatura proponen la utilización de metaheurísticas como algoritmos …
-
Smoothed Complexity of Network Coordination Games
… prove that using the 2-Flip algorithm on 2-Flip-Max-Cut achieves smoothed quasipolynomial time, we discuss multiple attempts at this goal, and hope to provide other researchers with the inspiration to prove quasipolynomial time.
-
APPLICATIONS OF GAUSSIAN FIELDS TO THE PERMANENT AND THE MATCHING POLYNOMIAL
… a semidefinite program and a relation to the Max-Cut problem and cut norms. In the second part of this thesis, we use these techniques to prove a new identity for the matching polynomial P_{G}(x) of a graph G. In doing so, we introduce a random procedure for estimating the coefficients of …
-
Algorithms and algorithmic obstacles for probabilistic combinatorial structures
… problems: Large Submatrix Selection, Maximum Cut (Max-Cut) of a graph and Matrix Completion. The Large Submatrix Selection problem is to find a k x k submatrix of an n x n matrix with i.i.d. standard Gaussian entries, which has the largest average entry. It was shown in [13] using …
-
Signal representations: from images to irregular-domain signals
… scheme for signals on general graphs based on maximum spanning trees is discussed in our third work. This framework provides a fast approximation of the max-cut, a criterion for downsampling on graphs, as well as a bipartite graph multiresolution, which is well-suited to the critical-sampling …
-
Polynomial systems : graphical structure, geometry, and applications
… captures many important applications, including Max-Cut, tensor low rank approximation, the triangulation problem, and rotation synchronization. Although these problems are nonconvex, tractable semidefinite programming (SDP) relaxations have been proposed. We introduce a methodology to derive …