Mum Requirement Hamilton Cycle Problem with a Monge-like Property
نویسنده
چکیده
Given a simple graph G with a vertex set V and a set of "requirements" {rvw \ v , w E V}, we consider a problem to find a Hamilton cycle minimizing an objective function similar to that in the optimum requirement spanning tree (ORST) problem studied by Hu. And we show that a particular Hamilton cycle C" which is explicitly definable is a solution to the problem when G is complete and { r v w } satisfies inverse Supnick property closely related to Monge property. It is of great interest that C* is also a solution to the symmetric traveling salesman problem with (not inverse) Supnick property. The result in this paper can be applied to the construction of ring networks with high reliability in case where the inverse Supnick property is naturally assumed.
منابع مشابه
A Generalized Optimum Requirement Spanning Tree Problem with a Monge-like Property
We consider a generalized optimum requirement spanning tree problem (GORST problem) which is an extension of the problem studied by Hu. In the GORST problem, the degrees of vertices are restricted and the objective function is generalized. We will show that a particular tree T*, which is obtained by a sort of greedy algorithm but is explicitly definable, is a solution to the GORST problem when ...
متن کاملConvergent Semi-Lagrangian Methods for the Monge-Ampère Equation on Unstructured Grids
This paper is concerned with developing and analyzing convergent semi-Lagrangian methods for the fully nonlinear elliptic Monge–Ampère equation on general triangular grids. This is done by establishing an equivalent (in the viscosity sense) Hamilton–Jacobi–Bellman formulation of the Monge–Ampère equation. A significant benefit of the reformulation is the removal of the convexity constraint from...
متن کاملA New Property of Hamilton Graphs
A Hamilton cycle is a cycle containing every vertex of a graph. A graph is called Hamiltonian if it contains a Hamilton cycle. The Hamilton cycle problem is to find the sufficient and necessary condition that a graph is Hamiltonian. In this paper, we give out some new kind of definitions of the subgraphs and determine the Hamiltoncity of edges according to the existence of the subgraphs in a gr...
متن کاملMonge matrices make maximization manageable
We continue the research on the eeects of Monge structures in the area of combinatorial optimization. We show that three optimization problems become easy if the underlying cost matrix fulllls the Monge property: (A) The balanced max{cut problem, (B) the problem of computing minimum weight binary k-matchings and (C) the computation of longest paths in bipartite, edge-weighted graphs. In all thr...
متن کاملA pricing problem under Monge property
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the largest utility, which is defined to be the difference between the benefit and the price of the item. The optimization problem is to decide on the prices that maximize total revenue of the seller. This problem is also call...
متن کامل