Results 1  10
of
315,188
MinMax tree covers of graphs
 Operations Research Letters
, 2004
"... We provide constant factor approximation algorithms for covering the nodes of a graph using trees (rooted or unrooted), under the objective function of minimizing the weight of the maximum weight tree, subject to an upper bound on the number of trees used. These problems are related to location rout ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
We provide constant factor approximation algorithms for covering the nodes of a graph using trees (rooted or unrooted), under the objective function of minimizing the weight of the maximum weight tree, subject to an upper bound on the number of trees used. These problems are related to location
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
Minmax computation tree logic
 Artificial Intelligence
, 2001
"... Abstract This paper introduces a branching time temporal query language called Minmax CTL which is similar in syntax to the popular temporal logic, CTL [8]. However unlike CTL, Minmax CTL can express timing queries on a timed model. We show that interesting timing queries involving a combination o ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract This paper introduces a branching time temporal query language called Minmax CTL which is similar in syntax to the popular temporal logic, CTL [8]. However unlike CTL, Minmax CTL can express timing queries on a timed model. We show that interesting timing queries involving a combination
Pseudopolynomial algorithms for minmax and minmax regret problems
 In 5th ISORA
, 2005
"... Abstract We present in this paper general pseudopolynomial time algorithms to solve minmax and minmax regret versions of some polynomial or pseudopolynomial problems under a constant number of scenarios. Using easily computable bounds, we can improve these algorithms. This way we provide pseudop ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
pseudopolynomial algorithms for the minmax and and minmax regret versions of several classical problems including minimum spanning tree, shortest path, and knapsack. minmax, minmax regret, computational complexity, pseudo
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
Approximation Algorithms for Minmax Capacitated Path Covers∗
"... This paper presents the first approximation algorithms and the first inapproximability results for minmax path cover problems, where a capacity constraint restricts the number of customers that can be serviced by every trip of the paths in the cover. Depending on different applications, every pa ..."
Abstract
 Add to MetaCart
This paper presents the first approximation algorithms and the first inapproximability results for minmax path cover problems, where a capacity constraint restricts the number of customers that can be serviced by every trip of the paths in the cover. Depending on different applications, every
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
Proof verification and hardness of approximation problems
 IN PROC. 33RD ANN. IEEE SYMP. ON FOUND. OF COMP. SCI
, 1992
"... We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probabilit ..."
Abstract

Cited by 797 (39 self)
 Add to MetaCart
vertex cover, maximum satisfiability, maximum cut, metric TSP, Steiner trees and shortest superstring. We also improve upon the clique hardness results of Feige, Goldwasser, Lovász, Safra and Szegedy [42], and Arora and Safra [6] and shows that there exists a positive ɛ such that approximating
Improved Approximation Algorithms for the Minmax Tree Cover and Bounded Tree Cover Problems
"... In this paper we provide improved approximation algorithms for the MinMax Tree Cover and Bounded Tree Cover problems. Given a graph G = (V, E) with weights w: E → Z +, a set T1, T2,..., Tk of subtrees of G is called a tree cover of G if V = ⋃k i=1 V (Ti). In the MinMax ktree Cover problem we are ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
In this paper we provide improved approximation algorithms for the MinMax Tree Cover and Bounded Tree Cover problems. Given a graph G = (V, E) with weights w: E → Z +, a set T1, T2,..., Tk of subtrees of G is called a tree cover of G if V = ⋃k i=1 V (Ti). In the MinMax ktree Cover problem we
Results 1  10
of
315,188