Matches in SemOpenAlex for { <https://semopenalex.org/work/W2053467581> ?p ?o ?g. }
Showing items 1 to 67 of
67
with 100 items per page.
- W2053467581 endingPage "348" @default.
- W2053467581 startingPage "334" @default.
- W2053467581 abstract "The well-known number partition problem is NP-hard even in the following version: Given a set S of n non-negative integers; partition S into two sets X and Y such that |X|=|Y| and the sum of the elements in X is as close as possible to the sum of the elements in Y (or equivalently, minimize the maximum of the two sums). In this paper we study the following generalization of the partition problem: given an edge-weighted graph G containing two edge-disjoint spanning trees. Find a pair of edge-disjoint spanning trees such that the maximum weight of these two trees is as small as possible. In the case when G is precisely the union of two trees this problem may be seen as a generalization of the partition problem in which we have added a graph structure to the numbers (through the edges) and the extra restriction that only the sets X and Y which correspond to trees in G are valid partitions. We first show how to obtain a 2-approximation via an algorithm for weighted matroid partition. Then we describe a simple heuristic which when applied to the 2-approximation above will result in a solution whose value is no more than 32 times the value of an optimal solution. We also show that the approach above may sometimes exclude all the optimal solutions. Both the partition problem and its generalization to the problem above on edge-disjoint spanning trees are special cases of the problem of finding, in a weighted matroid with two disjoint bases, a pair of disjoint bases which minimize the maximum of their weights. In the last part of the paper we give some results on this problem for transversal matroids which turn out to be analogous to those for graphs." @default.
- W2053467581 created "2016-06-24" @default.
- W2053467581 creator A5023564551 @default.
- W2053467581 creator A5037418562 @default.
- W2053467581 creator A5070148734 @default.
- W2053467581 date "2007-12-01" @default.
- W2053467581 modified "2023-10-18" @default.
- W2053467581 title "Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs" @default.
- W2053467581 cites W1479863711 @default.
- W2053467581 cites W1539230026 @default.
- W2053467581 cites W1548164611 @default.
- W2053467581 cites W1985667642 @default.
- W2053467581 cites W2026891055 @default.
- W2053467581 cites W2064702321 @default.
- W2053467581 cites W2074250264 @default.
- W2053467581 cites W2136878842 @default.
- W2053467581 cites W2752885492 @default.
- W2053467581 cites W3145128584 @default.
- W2053467581 cites W73629738 @default.
- W2053467581 doi "https://doi.org/10.1016/j.disopt.2007.09.003" @default.
- W2053467581 hasPublicationYear "2007" @default.
- W2053467581 type Work @default.
- W2053467581 sameAs 2053467581 @default.
- W2053467581 citedByCount "1" @default.
- W2053467581 crossrefType "journal-article" @default.
- W2053467581 hasAuthorship W2053467581A5023564551 @default.
- W2053467581 hasAuthorship W2053467581A5037418562 @default.
- W2053467581 hasAuthorship W2053467581A5070148734 @default.
- W2053467581 hasConcept C106286213 @default.
- W2053467581 hasConcept C114614502 @default.
- W2053467581 hasConcept C118615104 @default.
- W2053467581 hasConcept C132525143 @default.
- W2053467581 hasConcept C33923547 @default.
- W2053467581 hasConcept C42812 @default.
- W2053467581 hasConcept C45340560 @default.
- W2053467581 hasConcept C48903430 @default.
- W2053467581 hasConcept C64331007 @default.
- W2053467581 hasConceptScore W2053467581C106286213 @default.
- W2053467581 hasConceptScore W2053467581C114614502 @default.
- W2053467581 hasConceptScore W2053467581C118615104 @default.
- W2053467581 hasConceptScore W2053467581C132525143 @default.
- W2053467581 hasConceptScore W2053467581C33923547 @default.
- W2053467581 hasConceptScore W2053467581C42812 @default.
- W2053467581 hasConceptScore W2053467581C45340560 @default.
- W2053467581 hasConceptScore W2053467581C48903430 @default.
- W2053467581 hasConceptScore W2053467581C64331007 @default.
- W2053467581 hasIssue "3-4" @default.
- W2053467581 hasLocation W20534675811 @default.
- W2053467581 hasOpenAccess W2053467581 @default.
- W2053467581 hasPrimaryLocation W20534675811 @default.
- W2053467581 hasRelatedWork W1964090655 @default.
- W2053467581 hasRelatedWork W1981684106 @default.
- W2053467581 hasRelatedWork W2053467581 @default.
- W2053467581 hasRelatedWork W2166018368 @default.
- W2053467581 hasRelatedWork W2810540738 @default.
- W2053467581 hasRelatedWork W2949883286 @default.
- W2053467581 hasRelatedWork W2963699585 @default.
- W2053467581 hasRelatedWork W4296995476 @default.
- W2053467581 hasRelatedWork W4297821056 @default.
- W2053467581 hasRelatedWork W4300822877 @default.
- W2053467581 hasVolume "4" @default.
- W2053467581 isParatext "false" @default.
- W2053467581 isRetracted "false" @default.
- W2053467581 magId "2053467581" @default.
- W2053467581 workType "article" @default.