Results 1  10
of
10,098
Approximation of Minimum Cost Homomorphisms
 In Proceddings of the 20th Annual European Symposium on Algorithms (ESA12
, 2012
"... Abstract. Let H be a fixed graph without loops. We prove that if H is a cocircular arc bigraph then the minimum cost homomorphism problem to H admits a polynomial time constant ratio approximation algorithm; otherwise the minimum cost homomorphism problem to H is known to be not approximable. This ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. Let H be a fixed graph without loops. We prove that if H is a cocircular arc bigraph then the minimum cost homomorphism problem to H admits a polynomial time constant ratio approximation algorithm; otherwise the minimum cost homomorphism problem to H is known to be not approximable
On Minimum Cost Edge Searching
"... We consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of s ..."
Abstract
 Add to MetaCart
We consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number
MinimumCost Multicast over Coded Packet Networks
 IEEE TRANS. ON INF. THE
, 2006
"... We consider the problem of establishing minimumcost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as b ..."
Abstract

Cited by 164 (28 self)
 Add to MetaCart
We consider the problem of establishing minimumcost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well
Minimum Cost Homomorphisms to Digraphs
, 2009
"... For digraphs D and H, a homomorphism of D to H is a mapping f: V (D)→V (H) such that uv ∈ A(D) implies f(u)f(v) ∈ A(H). Suppose D and H are two digraphs, and ci(u), u ∈ V (D), i ∈ V (H), are nonnegative integer costs. The cost of the homomorphism f of D to H is ∑ u∈V (D) c f(u)(u). The minimum cost ..."
Abstract
 Add to MetaCart
For digraphs D and H, a homomorphism of D to H is a mapping f: V (D)→V (H) such that uv ∈ A(D) implies f(u)f(v) ∈ A(H). Suppose D and H are two digraphs, and ci(u), u ∈ V (D), i ∈ V (H), are nonnegative integer costs. The cost of the homomorphism f of D to H is ∑ u∈V (D) c f(u)(u). The minimum
Minimum cost arborescences
 Games and Economic Behavior
, 2011
"... Abstract In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the wellstudied problem of minimum cost span ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the wellstudied problem of minimum cost
Minimum Cost Homomorphisms of Digraphs
, 2005
"... For digraphs D and H, a mapping f: V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). For a fixed directed or undirected graph H and an input graph D, the problem of verifying whether there exists a homomorphism of D to H has been studied in a large number of papers. We s ..."
Abstract
 Add to MetaCart
). The cost of a homomorphism f of D to H is ∑ u∈V (D) cf(u)(u). For a fixed digraph H, the minimum cost homomorphism problem MinHOMP(H) is, for an input digraph D, to verify whether there is a homomorphism of D to H and, if it does exist, to find such a homomorphism of minimum cost. We introduce a general
Submodularity of MinimumCost Spanning Tree
"... We give a necessary condition and a sufficient condition for a minimumcost spanning tree game introduced by Bird to be submodular (or convex). When the cost is restricted to two values, we give a characterization of submodular minimumcost spanning tree games. We also discuss algorithmic issues. ..."
Abstract
 Add to MetaCart
We give a necessary condition and a sufficient condition for a minimumcost spanning tree game introduced by Bird to be submodular (or convex). When the cost is restricted to two values, we give a characterization of submodular minimumcost spanning tree games. We also discuss algorithmic issues.
Minimum Cost Flows on Hypergraphs
, 1992
"... Directed hypergraphs have been introduced quite recently in connection with different application areas, such as propositional satisfiability, deductive data bases and Leontief substitution systems. In [Jeroslow, Martin, Rardin&Wang, 1989], the uncapacitated mincost flow problem on hypergraphs ..."
Abstract
 Add to MetaCart
Directed hypergraphs have been introduced quite recently in connection with different application areas, such as propositional satisfiability, deductive data bases and Leontief substitution systems. In [Jeroslow, Martin, Rardin&Wang, 1989], the uncapacitated mincost flow problem on hypergraphs
Results 1  10
of
10,098