A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Reload cost problems: minimum diameter spanning tree
2001
Discrete Applied Mathematics
Preserved Fulltext
We consider the problem of ÿnding a spanning tree of minimum diameter with respect to the reload costs. We present lower bounds for the approximability even on graphs with maximum degree 5. ...
We examine a network design problem under the reload cost model. ...
It is possible to formulate other well known network design problems under the reload cost model, e.g. the problem of ÿnding a spanning tree of minimum total cost. ...
doi:10.1016/s0166-218x(00)00392-9
fatcat:nbung2c6h5dxhkhgjzamyop5fu
The complexity of a minimum reload cost diameter problem
2008
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We consider the minimum diameter spanning tree problem under the reload cost model which has been introduced by Wirth and Steffan [H.-C. Wirth, J. ...
Steffan, Reload cost problems: Minimum diameter spanning tree, Discrete Appl. Math. 113 (2001) 73-85]. ...
In this paper we consider the minimum diameter spanning tree problem under the reload cost model (MIN-DIAM), i.e. the problem of finding a spanning tree of G having a minimum diameter with respect to the ...
doi:10.1016/j.dam.2008.02.013
fatcat:556ahxr3brhk3f7z3ypa4bdaaq
Reload cost trees and network design
2011
Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Specifically, the only paper in which reload costs appear is by Wirth and Steffan [1] who introduce a minimum diameter spanning tree with reload costs. ...
The authors show that the minimum diameter reload cost spanning tree problem is NP-hard for graphs with an arbitrary node degree. ...
doi:10.1002/net.20443
fatcat:piqotbhd35bzfpp2g2uvkeli6a
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We study the minimum diameter spanning tree problem under the reload cost model (DIAMETER-TREE for short) introduced by Wirth and Steffan (2001). ...
The objective is to find a spanning tree of G of minimum diameter with respect to the reload costs. ...
The work in [33] , which introduced the concept of reload cost, focused on the following problem, called Minimum Reload Cost Diameter Spanning Tree (Diameter-Tree for short), and which is the one we study ...
arXiv:1703.01686v2
fatcat:uguqfwge3nezfd2jw72bgcam2a
On the complexity of constructing minimum changeover cost arborescences
2014
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Previous work on reload costs focuses on two problems of finding a spanning tree with minimum cost with respect to two different cost measures. ...
The reload cost concept refers to the cost that occurs at a vertex along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. ...
In [7] the authors study the minimum diameter reload cost spanning tree problem for graphs with maximum degree 4. ...
doi:10.1016/j.tcs.2014.03.023
fatcat:rj2wps5cmbf4xpr2vaxsrvwwsi
Efficient Edge-swapping heuristics for the reload cost spanning tree problem
2015
Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The goal is to find a spanning tree with minimum reload cost. ...
The reload cost spanning tree problem (RCSTP) is an NP-hard problem, where we are given a set of nonnegative pairwise demands between nodes, each edge is colored and a reload cost is incurred when a color ...
The first article to feature reload costs was by Wirth and Steffan (2001) where they introduce the minimum diameter spanning trees with reload costs. ...
doi:10.1002/net.21609
fatcat:yjvtamz3mjf7pnvq76ip36nxpy
Edge Coloring with Minimum Reload/Changeover Costs
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The second pair of problems aim to find a proper edge coloring and a spanning tree so that the reload/changeover cost is minimized. ...
In this paper, we formulate and focus on two pairs of problems that aim to find an edge coloring of a graph so as to minimize the reload and changeover costs. ...
The works [1, 2] consider the problem of finding a spanning tree having minimum diameter with respect to reload cost. ...
arXiv:1607.06751v1
fatcat:zph2agm6krdd7fpl6zhpx3uj2m
Page 5214 of Mathematical Reviews Vol. , Issue 2002G
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
, Jan (D-DARM-ITO; Darmstadt)
Reload cost problems: minimum diameter spanning tree. ...
We consider the problem of finding a spanning tree of minimum diameter with respect to the reload costs. We present lower bounds for the approximability even on graphs with maximum degree 5. ...
The non-approximability of bicriteria network design problems
2003
Journal of Discrete Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We want to minimize the diameter of a spanning subgraph S (under d-cost) subject to the constraint that the total cost of the edges in S (with respect to c) does not exceed a given budget. ...
Let G be an undirected graph with two edge costs (c-cost and d-cost). ...
reload cost [19] . ...
doi:10.1016/s1570-8667(03)00033-9
fatcat:czkqvz44qff5hehdfw5as7nc6y
Minimum Reload Cost Cycle Cover in Complete Graphs
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Galbiati et al.[1] introduced the Minimum Reload Cost Cycle Cover problem, which is to find a set of vertex-disjoint cycles spanning all vertices with minimum reload cost. ...
We prove that except possibly on complete graphs with fewer than 13 vertices, the minimum reload cost is zero on complete graphs with nearly equitable 2-edge-colorings by proving the existence of a monochromatic ...
Wirth and Steffan [2] and Galbiati [3] studied the minimum reload cost diameter problem, which is to find a spanning tree with minimum diameter with respect to reload cost. Amaldi et al. ...
arXiv:1706.05225v1
fatcat:xm3vmczg4fapxp7rq3er2zeztq
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover cost. ...
The "Minimum Changeover Cost Arborescence" (MINCCA) problem consists in finding an arborescence with a given root vertex such that the total changeover cost of the internal vertices is minimized. ...
The reload cost concept was introduced in [19] , where the considered problem is to find a spanning tree having minimum diameter with respect to reload cost. ...
arXiv:1605.00532v1
fatcat:s5umg7hsajhndkdeuq6bnvmvla
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover cost. ...
The Minimum Changeover Cost Arborescence (MinCCA) problem consists in finding an arborescence with a given root vertex such that the total changeover cost of the internal vertices is minimized. ...
The reload cost concept was introduced in [19] , where the considered problem is to find a spanning tree having minimum diameter with respect to reload cost. ...
doi:10.1007/978-3-662-53536-3_17
fatcat:h6phpbwirjdcjlm55qvjdkh6eq
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
2017
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover cost. ...
The Minimum Changeover Cost Arborescence (MinCCA) problem consists in finding an arborescence with a given root vertex such that the total changeover cost of the internal vertices is minimized. ...
The reload cost concept was introduced in [19] , where the considered problem is to find a spanning tree having minimum diameter with respect to reload cost. ...
doi:10.1016/j.tcs.2017.06.013
fatcat:gtn7zr7sujh4fb5ox7mzep2y7q
Minimum Reload Cost Graph Factors
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The problem of finding a spanning tree whose diameter with respect to the reload costs is the smallest possible, the problems of finding a path, trail or walk with minimum total reload cost between two ...
given vertices, problems about finding a proper edge coloring of a graph such that the total reload cost is minimized, the problem of finding a spanning tree such that the sum of the reload costs of all ...
Each of E, E has an associated reload cost on v. ...
arXiv:1810.11700v2
fatcat:j55ztzn3hvdbta3t43zz3xk4gm
Investigating Behavior of Cantilever Beams of Normal and Lightweight Reinforced Concrete under Cyclic Load
2015
Indian Journal of Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Five samples of cantilever beams are developed; tree of which are made of lightweight aggregate concrete, while two are made of normal weight concrete. ...
With respect to ratio of the shear span to significant depth of the test specimens, the flexural behavior is dominant and the beams endure ductility of greater than 4. ...
Reducing the dead load will result in decreased force of earthquake, size of beams, columns, and foundation, minimum required rebar, and costs. ...
doi:10.17485/ijst/2015/v8i28/87172
fatcat:7tuzlc2pivf6jcedwathkumk44
« Previous
Showing results 1 — 15 out of 329 results