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 15 of 15 for “"Min-cut"”.
-
Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut)
… studied in this thesis is that of comparing a minimum-delay time-varying routing assignment in a dynamic network where the node demands and link capacities are deterministic functions of time, and where the commodity being routed is represented by continuous variables. A single node is …
-
A Cut Search Approach to Max-Flow Min-Cut Problems and Cost Duration Analysis
Made available in DSpace on 2014-12-10T22:48:28Z (GMT). No. of bitstreams: 1 7511768.pdf: 4337186 bytes, checksum: 5b3e63b676ddd12f803feeb93c630ba0 (MD5) Previous issue date: 1974
-
Enhancing network robustness via shielding
… integer linear program (MILP) to obtain the minimum cost shielding to guarantee the connectivity of a single source-destination (SD) pair under a general failure model, and exploit geographical properties to decompose the shielding problem under a geographical failure model. We extend our …
-
Cuts and connectivity in graphs and hypergraphs
In this thesis, we consider cut and connectivity problems on graphs, digraphs, hypergraphs and hedgegraphs. The main results are the following: - We introduce a faster algorithm for finding the reduced graph in element-connectivity computations. We also show its application to node separation. - We …
-
Large Scale Machine Learning in Biology
… relationships between optimizing the regularized min-cut cost function used in spectral clustering and the relevance information as defined in the Information Bottleneck method. For fast-mixing graphs, we show that the regularized min-cut cost functions introduced by Shi and Malik over a decade …
-
Cheeger sets for unit cube : analytical and numerical solutions for L [infinity] and L² norms
… constant h(Q) of a domain Q is defined as the minimum value of ...... with D varying over all smooth sub-domains of Q. The D that achieves this minimum is called the Cheeger set of Q. We present some analytical and numerical work on the Cheeger set for the unit cube ... using the ...and the ... …
-
Topics in multi-terminal wireless networks
… information theory are used to study multiterminal wireless networks. A compress-and-forward scheme with layered decoding is presented for the unicast and multi-source wireless network and shown to be approximately optimal. This scheme is shown to allow better decoding complexity compared to …
-
Layering principles for wireless networks
… routing (flow) for multiple-unicast traffic: the min-cut upper bound is within a logarithmic factor of the number of sources of the max-flow. This establishes the approximate capacity of multiple-unicast in wireline networks. In this thesis, we ``extend'' this wireline result to the wireless …
-
Network security and min-cost max-flow problem
… faces cost of disrupting links. Linear programming duality and the Max-Flow Min-Cut Theorem are applied to obtain properties that are satisfied in any Nash equilibrium. Using graph theoretic arguments, we give a characterization of the support of the equilibrium strategies. Finally, we study …
-
Animal Internal Motion Analysis with Unsupervised Machine Learning Methods
… While our laboratory's previously established Minimum-Cost Circulation-Based Framework provides a foundational approach, it suffers from limitations in robustness due to inadequate accuracy in cell segmentation. To address these shortcomings, we introduce PrinCut-Auto, a cutting-edge method …
-
Linear algebraic approaches to coding for multiple unicast networks
… behind our approaches. We start with careful examination of the algebraic framework of network coding, which forms the foundation of many important theoretic and practical network coding results. Our results on atomic decomposition of network transfer matrix and the edge reduction lemma …
-
Cuts and partitions: solving, counting, and enumerating
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms
-
Investigations into effectively moving people and goods
… approach integrates a system perspective, i.e., minimizing congestion, and a user perspective, i.e., minimizing inconvenience. As a design choice, we only solve linear program which is more likely to scale well and be of practical use. The linear structure of our models allows us to derive …
-
On the robustness of network infrastructures to disasters and physical attacks
… the geographical layout of the network determines the impact of such events on the network's connectivity. We focus on network analysis and design under a geographic failure model of (geographical) networks to such disasters. Initially, we aim to identify the most vulnerable parts of data …