Results 1  10
of
125,619
Minmax graph partitioning and small set expansion
, 2011
"... We study graph partitioning problems from a minmax perspective, in which an input graph on n vertices should be partitioned into k parts, and the objective is to minimize the maximum number of edges leaving a single part. The two main versions we consider are: (i) the k parts need to be of equal s ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
We study graph partitioning problems from a minmax perspective, in which an input graph on n vertices should be partitioned into k parts, and the objective is to minimize the maximum number of edges leaving a single part. The two main versions we consider are: (i) the k parts need to be of equal
Iteration of (Min,Max,+) functions
"... We actually show that the behavior of (Min,Max,+) systems is indeed the same that the one of (Max,+) systems. If the evolution of such a (Min,Max,+) system is given through a function F , it turns out that 8x 2 R n , F t (x) = t:u +P t + OE t . Here, u is independent of x and is called the m ..."
Abstract
 Add to MetaCart
We actually show that the behavior of (Min,Max,+) systems is indeed the same that the one of (Max,+) systems. If the evolution of such a (Min,Max,+) system is given through a function F , it turns out that 8x 2 R n , F t (x) = t:u +P t + OE t . Here, u is independent of x and is called
MinMax Problems on FactorGraphs
"... We study the minmax problem in factor graphs, which seeks the assignment that minimizes the maximum value over all factors. We reduce this problem to both minsum and sumproduct inference, and focus on the later. In this approach the minmax inference problem is reduced to a sequence of Constrain ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study the minmax problem in factor graphs, which seeks the assignment that minimizes the maximum value over all factors. We reduce this problem to both minsum and sumproduct inference, and focus on the later. In this approach the minmax inference problem is reduced to a sequence
Dynamic MinMax Problems
 Swiss Federal Institute of Technology (ETH Zurich), TIK (Computer Engineering and Networks Laboratory
, 1997
"... In this paper we address minmax equations for periodic and nonperiodic problems. In the nonperiodic case a simple algorithm is presented to determine whether a graph has a potential satisfying the minmax equations. This method can also be used to solve a more general minmax problem on periodic g ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this paper we address minmax equations for periodic and nonperiodic problems. In the nonperiodic case a simple algorithm is presented to determine whether a graph has a potential satisfying the minmax equations. This method can also be used to solve a more general minmax problem on periodic
Computation of the MinMax Measure
, 1998
"... The MinMax measure of information, defined by Kapur, Baciu and Kesavan [6], is a quantitative measure of the information contained in a given set of moment constraints. It is based on both maximum and minimum entropy. Computational difficulties in the determination of minimum entropy probability dis ..."
Abstract
 Add to MetaCart
The MinMax measure of information, defined by Kapur, Baciu and Kesavan [6], is a quantitative measure of the information contained in a given set of moment constraints. It is based on both maximum and minimum entropy. Computational difficulties in the determination of minimum entropy probability
On a MinMax Theorem of Cacti
, 1997
"... A simple proof is presented for the minmax theorem of Lov'asz on cacti. Instead of using the result of Lov'asz on matroid parity, we shall apply twice the (conceptionally simpler) matroid intersection theorem. 1 Introduction The graph matching problem and the matroid intersection problem ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A simple proof is presented for the minmax theorem of Lov'asz on cacti. Instead of using the result of Lov'asz on matroid parity, we shall apply twice the (conceptionally simpler) matroid intersection theorem. 1 Introduction The graph matching problem and the matroid intersection
On approximate minmax theorems of graph connectivity problems
, 2006
"... Given an undirected graph G and a subset of vertices S ` V (G), we call the vertices in S the terminal vertices and the vertices in V (G) S the Steiner vertices. In this thesis, we study two problems whose goals are to achieve high "connectivity " among the terminal vertices. The ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
arcdisjoint paths to each terminal vertex in D. Both problems are generalizations of two classical graph theoretical problems: the edgedisjoint s, tpaths problem and the edgedisjoint spanning trees problem. Polynomial time algorithms and exact minmax relations are known for the classical problems
A Minmax Cult Algorithm for Graph Partitioning and Data Clustering
"... An important application of graph partitioning is data clustering using a,graph model the pairwise similarities between all data objects form a weighted graph adjacency matrix that contains all necessary information for clustering. Here we propose a new algorithm for graph partition with an objec ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
are derived. The minmax cut algorithm is tested on newsgroup datasets and is found t o outperform other current popular partitioning/clustering methods. The linkage
Approximation Algorithms for MinMax Generalization Problems
"... Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In minmax generalization problems, the input consists of data items with weights and a lower bound wlb, and the goal is to partition individual items i ..."
Abstract
 Add to MetaCart
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In minmax generalization problems, the input consists of data items with weights and a lower bound wlb, and the goal is to partition individual items
Results 1  10
of
125,619