umu.sePublikationer
Ändra sökning
Avgränsa sökresultatet
123 1 - 50 av 132
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
• apa
• ieee
• modern-language-association-8th-edition
• vancouver
• Annat format
Fler format
Språk
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Annat språk
Fler språk
Utmatningsformat
• html
• text
• asciidoc
• rtf
Träffar per sida
• 5
• 10
• 20
• 50
• 100
• 250
Sortering
• Standard (Relevans)
• Författare A-Ö
• Författare Ö-A
• Titel A-Ö
• Titel Ö-A
• Publikationstyp A-Ö
• Publikationstyp Ö-A
• Äldst först
• Nyast först
• Disputationsdatum (tidigaste först)
• Disputationsdatum (senaste först)
• Standard (Relevans)
• Författare A-Ö
• Författare Ö-A
• Titel A-Ö
• Titel Ö-A
• Publikationstyp A-Ö
• Publikationstyp Ö-A
• Äldst först
• Nyast först
• Disputationsdatum (tidigaste först)
• Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
• 1. Aaghabali, M.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges2015Ingår i: European journal of combinatorics (Print), ISSN 0195-6698, E-ISSN 1095-9971, Vol. 45, s. 132-144Artikel i tidskrift (Refereegranskat)

We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on 2n vertices. The upper bound is sharp for even n. For odd n we state a conjecture on a sharp upper bound.

• 2. Akbari, Saieed
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
On 1-sum flows in undirected graphs2016Ingår i: The Electronic Journal of Linear Algebra, ISSN 1537-9582, E-ISSN 1081-3810, Vol. 31, s. 646-665Artikel i tidskrift (Refereegranskat)

Let G = (V, E) be a simple undirected graph. For a given set L subset of R, a function omega: E -> L is called an L-flow. Given a vector gamma is an element of R-V , omega is a gamma-L-flow if for each v is an element of V, the sum of the values on the edges incident to v is gamma(v). If gamma(v) = c, for all v is an element of V, then the gamma-L-flow is called a c-sum L-flow. In this paper, the existence of gamma-L-flows for various choices of sets L of real numbers is studied, with an emphasis on 1-sum flows. Let L be a subset of real numbers containing 0 and denote L* := L \ {0}. Answering a question from [S. Akbari, M. Kano, and S. Zare. A generalization of 0-sum flows in graphs. Linear Algebra Appl., 438:3629-3634, 2013.], the bipartite graphs which admit a 1-sum R* -flow or a 1-sum Z* -flow are characterized. It is also shown that every k-regular graph, with k either odd or congruent to 2 modulo 4, admits a 1-sum {-1, 0, 1}-flow.

• 3.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Avoiding Arrays of Odd Order by Latin Squares2013Ingår i: Combinatorics, probability & computing, ISSN 0963-5483, E-ISSN 1469-2163, Vol. 22, nr 2, s. 184-212Artikel i tidskrift (Refereegranskat)

We prove that there is a constant c such that, for each positive integer k, every (2k + 1) x (2k + 1) array A on the symbols 1, ... , 2k + 1 with at most c(2k + 1) symbols in every cell, and each symbol repeated at most c(2k + 1) times in every row and column is avoidable; that is, there is a (2k + 1) x (2k + 1) Latin square S on the symbols 1, ... , 2k + 1 such that, for each i, j is an element of {1, ... , 2k + 1}, the symbol in position (i, j) of S does not appear in the corresponding cell in Lambda. This settles the last open case of a conjecture by Haggkvist. Using this result, we also show that there is a constant rho, such that, for any positive integer n, if each cell in an n x n array B is assigned a set of m <= rho n symbols, where each set is chosen independently and uniformly at random from {1, ... , n}, then the probability that B is avoidable tends to 1 as n -> infinity.

• 4.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
On the Ising problem and some matrix operations2007Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)

The first part of the dissertation concerns the Ising problem proposed to Ernst Ising by his supervisor Wilhelm Lenz in the early 20s. The Ising model, or perhaps more correctly the Lenz-Ising model, tries to capture the behaviour of phase transitions, i.e. how local rules of engagement can produce large scale behaviour.

Two decades later Lars Onsager solved the Ising problem for the quadratic lattice without an outer field. Using his ideas solutions for other lattices in two dimensions have been constructed. We describe a method for calculating the Ising partition function for immense square grids, up to linear order 320 (i.e. 102400 vertices).

In three dimensions however only a few results are known. One of the most important unanswered questions is at which temperature the Ising model has its phase transition. In this dissertation it is shown that an upper bound for the critical coupling Kc, the inverse absolute temperature, is 0.29 for the tree dimensional cubic lattice.

To be able to get more information one has to use different statistical methods. We describe one sampling method that can use simple state generation like the Metropolis algorithm for large lattices. We also discuss how to reconstruct the entropy from the model, in order to obtain parameters as the free energy.

The Ising model gives a partition function associated with all finite graphs. In this dissertation we show that a number of interesting graph invariants can be calculated from the coefficients of the Ising partition function. We also give some interesting observations about the partition function in general and show that there are, for any N, N non-isomorphic graphs with the same Ising partition function.

The second part of the dissertation is about matrix operations. We consider the problem of multiplying them when the entries are elements in a finite semiring or in an additively finitely generated semiring. We describe a method that uses O(n3 / log n) arithmetic operations.

We also consider the problem of reducing n x n matrices over a finite field of size q using O(n2 / logq n) row operations in the worst case.

• 5.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Avoidability by Latin squares of arrays of even orderManuskript (preprint) (Övrigt vetenskapligt)

We prove that for any k and any 2k × 2k array A such that no cell in A contains more than   k/2550 symbols, and no symbol occurs more than k/2550 times in any row or column, there is a Latin square such that no 2550cell in the Latin square contains a symbol that occurs in the corresponding cell in A. This proves a conjecture of Häggkvist [8] in the special case of arrays with even side.

• 6.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Avoidability of random arraysManuskript (preprint) (Övrigt vetenskapligt)

An n×n array that in each cell contains a subset of the symbols 1, . . . , n is avoidable if there exists a Latin square of order n such that no cell in the Latin square contains a symbol which belongs to the set of symbols in the corresponding cell of the array. Some results on deterministic conditions for avoidability of arrays have been found, but here we study the problem of having an array with randomly assigned subsets of C in its cells. This is equivalent to the problem of list-edge-coloring $K_{n,n}$ with randomly assigned lists from the set {1, . . . , n}. We show that an array where each symbol appears in each cell with probability p will be avoidable with very high probability even if p is such that the expected number of symbols forbidden in each cell is slightly higher than what deterministic theorems can prove is avoidable.

• 7.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Avoiding (m, m, m)-arrays of order n = 2kManuskript (preprint) (Övrigt vetenskapligt)

An (m, m, m)-array of order n is an n × n array such that each cell is assigned a set of at most m symbols from {1,...,n} such that no symbol occurs more than m times in any row or column. An (m,m,m)- array is called avoidable if there exists a Latin square such that no cell in the Latin square contains a symbol that also belongs to the set assigned to the corresponding cell in the array. We show that there is a constant γ such that if m ≤ γ2k, then any (m,m,m)-array of order 2k is avoidable. Such a constant γ has been conjectured to exist for all n by Häggkvist.

• 8.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
On Latin squares and avoidable arrays2010Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)

Denna avhandling inehåller de fyra nedan uppräknade artiklarna, samt en översikt av forskningsområdet.

I Lina J. Andrén: Avoiding (m, m, m)-arrays of order n = 2k

II Lina J. Andrén: Avoidability of random arrays

III Lina J. Andrén: Avoidability by Latin squares of arrays with even order

IV Lina J. Andrén, Carl Johan Casselgren and Lars-Daniel Öhman: Avoiding arrays of odd order by Latin squares

Artikel I, III och IV behandlar en förmodan av Häggkvist, som säger att det finns en konstant c sådan att för varje positivt heltal n gäller att om m ≤ cn så finns för varje n × n array A av delmängder till {1, . . . ,n} sådan att ingen cell i A i innehåller fler än m symboler, och ingen symbol förekommer i fler än m celler i någon av raderna eller kolumnerna, så finns en latinsk kvadrat L sådan att ingen cell i L innehåller en symbol som förekommer i motsvarande cell i A. En sådan latinsk kvadrat sägs undvika A. Artikel I innehåller ett bevis av förmodan i specialfallet n = 2k. Artikel III använder och utökar metoderna i Artikel I till ett bevis av förmodan för alla latinska kvadrater av jämn ordning. Förmodan visas slutligen för samtliga ordningar i Artikel IV, där bevismetoden liknar den som finns i i Artikel I och III tillsammans med en omfärgningssats. Artikel II behandlar en annan aspekt av problemet genom att undersöka vad ett deterministiskt resultat om existens av latinska kvadrater som undviker en viss typ av array säger om arrayer där mängderna tilldelas slumpmässigt.

• 9.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik. Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Avoiding arrays of odd order by Latin squaresManuskript (preprint) (Övrigt vetenskapligt)

We prove that there exists a constant c such that for each pos- itive integer k every (2k+1)×(2k+1) array A on the symbols 1,...,2k+1 with at most c(2k + 1) symbols in every cell, and each symbol repeated at most c(2k+1) times in every row and column is avoidable; that is, there is a (2k+1)×(2k+1) Latin square S on the symbols 1,...,2k+1 such that for each cell (i, j) in S the symbol in (i, j) does not appear in the corresponding cell in A. This settles the last open case of a conjecture by Häggkvist.

• 10.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik. Southern Polytechnic State University, Marietta, Georgia. University of Illinois, Urbana, Illinois.
Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs2009Ingår i: Journal of Graph Theory, ISSN 0364-9024, E-ISSN 1097-0118, Vol. 61, nr 2, s. 88-97Artikel i tidskrift (Refereegranskat)

An interval coloring of a graph G is a proper coloring of E(G) by positive integers such that the colors on the edges incident to any vertex are consecutive. A (3,4)-biregular bigraph is a bipartite graph in which each vertex of one part has degree 3 and each vertex of the other has degree 4; it is unknown whether these all have interval colorings. We prove that G has an interval coloring using 6 colors when G is a (3,4)-biregular bigraph having a spanning subgraph whose components are paths with endpoints at 3-valent vertices and lengths in {2, 4, 6, 8}. We provide several sufficient conditions for the existence of such a subgraph.

• 11.
Christian-Albrechts Universität Kiel.
Christian-Albrechts Universität Kiel. Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik. Christian-Albrechts Universität Kiel. Christian-Albrechts Universität Kiel.
Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection2015Ingår i: Journal of the Operational Research Society, ISSN 0160-5682, E-ISSN 1476-9360, Vol. 66, nr 4, s. 615-626Artikel i tidskrift (Refereegranskat)

We introduce and study the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection (TSP-MTWHS), which generalises the well-known Travelling Salesman Problem with Time Windows and the recently introduced Travelling Salesman Problem with Hotel Selection. The TSP-MTWHS consists in determining a route for a salesman (eg, an employee of a services company) who visits various customers at different locations and different time windows. The salesman may require a several-day tour during which he may need to stay in hotels. The goal is to minimise the tour costs consisting of wage, hotel costs, travelling expenses and penalty fees for possibly omitted customers. We present a mixed integer linear programming (MILP) model for this practical problem and a heuristic combining cheapest insert, 2-OPT and randomised restarting. We show on random instances and on real world instances from industry that the MILP model can be solved to optimality in reasonable time with a standard MILP solver for several small instances. We also show that the heuristic gives the same solutions for most of the small instances, and is also fast, efficient and practical for large instances.

• 12.
Christian-Albrechts Universität Kiel, Germany.
Christian-Albrechts Universität Kiel, Germany. Christian-Albrechts Universität Kiel, Germany.
Construction of Sparse Asymmetric Connectors2003Ingår i: Proceedings of European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2003), 2003Konferensbidrag (Refereegranskat)
• 13.
Christian-Albrechts-Universität Kiel, Germany.
Christian-Albrechts-Universität Kiel, Germany. Christian-Albrechts-Universität Kiel, Germany.
Constructions of Sparse Asymmetric Connectors2003Ingår i: Proceedings of 23rd Conference of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2003) / [ed] P.K. Lodaya and J. Radhakrishnan, Berlin-Heidelberg: Springer Berlin/Heidelberg, 2003, s. 13-22Konferensbidrag (Refereegranskat)
• 14.
Mathematisches seminar, Christian-Albrechts-Universität zu Kiel, Germany.
Mathematisches seminar, Christian-Albrechts-Universität zu Kiel, Germany. Mathematisches seminar, Christian-Albrechts-Universität zu Kiel, Germany.
Constructions of Sparse Asymmetric Connectors with Number Theoretic Methods2005Ingår i: Networks, ISSN 0028-3045, E-ISSN 1097-0037, Vol. 45, nr 3, s. 119-124Artikel i tidskrift (Refereegranskat)

We consider the problem of connecting a set I of n inputs to a set O of N outputs (n ≤ N) by as few edges as possible such that for every injective mapping f : I → O there are n vertex disjoint paths from i to f(i) of length k for a given k $\in \mathbb{N}$. For k = Ω(log N + log$^{2}$n) Oruς (1994) gave the presently best (n,N)-connector with O(N+n·log n) edges. For k=2 and N the square of a prime, Richards and Hwang (1985) described a construction using $N\left[\sqrt{n+5/4-1/2}\right] + n\left[\sqrt{n+5/4-1/2} \right]\sqrt{N}$edges. We show by a probabilistic argument that an optimal (n,N)-connector has Θ (N) edges, if $n\leq N^{1/2-\varepsilon}$for some ε>0. Moreover, we give explicit constructions based on a new number theoretic approach that need at most $N\left[\sqrt{3n/4} \right]+2n\left[\sqrt{3n/4} \right]\left[\sqrt{N} \right]$edges for arbitrary choices of n and N. The improvement we achieve is based on applying a generalization of the Erdös-Heilbronn conjecture on the size of restricted sums.

• 15.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap. Department of Information Science, Stellenbosch University, Stellenbosch, South Africa.
Minimization of Finite State Automata Through Partition Aggregation2016Ingår i: Logical Aspects of Computational Linguistics: Celebrating 20 Years of LACL (1996–2016) / [ed] Amblard, M DeGroote, P Pogodalla, S Retore, C, SPRINGER-VERLAG BERLIN , 2016, s. 328-328Konferensbidrag (Refereegranskat)
• 16.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
On avoiding some families of arrays2012Ingår i: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 312, nr 5, s. 963-972Artikel i tidskrift (Refereegranskat)

An n×n array A with entries from {1,…,n} is avoidable if there is an n×n Latin square L such that no cell in L contains a symbol that occurs in the corresponding cell in A. We show that the problem of determining whether an array that contains at most two entries per cell is avoidable is NP-complete, even in the case when the array has entries from only two distinct symbols. Assuming that PNP, this disproves a conjecture by Öhman. Furthermore, we present several new families of avoidable arrays. In particular, every single entry array (arrays where each cell contains at most one symbol) of order n≥2k with entries from at most k distinct symbols and where each symbol occurs in at most n−2 cells is avoidable, and every single entry array of order n, where each of the symbols 1,…,n occurs in at most cells, is avoidable. Additionally, if k≥2, then every single entry array of order at least n≥4, where at most k rows contain non-empty cells and where each symbol occurs in at most nk+1 cells, is avoidable.

• 17.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
On some graph coloring problems2011Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
• 18. Casselgren, Carl Johan
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Coloring Complete and Complete Bipartite Graphs from Random Lists2016Ingår i: Graphs and Combinatorics, ISSN 0911-0119, E-ISSN 1435-5914, Vol. 32, nr 2, s. 533-542Artikel i tidskrift (Refereegranskat)

Assign to each vertex v of the complete graph on n vertices a list L(v) of colors by choosing each list independently and uniformly at random from all f(n)-subsets of a color set , where f(n) is some integer-valued function of n. Such a list assignment L is called a random (f(n), [n])-list assignment. In this paper, we determine the asymptotic probability (as ) of the existence of a proper coloring of , such that for every vertex v of . We show that this property exhibits a sharp threshold at . Additionally, we consider the corresponding problem for the line graph of a complete bipartite graph with parts of size m and n, respectively. We show that if , , and L is a random (f(n), [n])-list assignment for the line graph of , then with probability tending to 1, as , there is a proper coloring of the line graph of with colors from the lists.

• 19. Casselgren, Carl Johan
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Completing partial Latin squares with one filled row, column and symbol2013Ingår i: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 313, nr 9, s. 1011-1017Artikel i tidskrift (Refereegranskat)

Let P be an n x n partial Latin square every non-empty cell of which lies in a fixed row r, a fixed column c or contains a fixed symbols. Assume further that s is the symbol of cell (r, c) in P. We prove that P is completable to a Latin square if n >= 8 and n is divisible by 4, or n <= 7 and n is not an element of {3, 4, 5}. Moreover, we present a polynomial algorithm for the completion of such a partial Latin square. (C) 2013 Elsevier B.V. All rights reserved.

• 20. Casselgren, Carl Johan
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik. Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Edge precoloring extension of hypercubesManuskript (preprint) (Övrigt vetenskapligt)

We consider the problem of extending partial edge colorings of hypercubes. In particular, we obtain an analogue of the positive solution to the famous Evans' conjecture on completing partial Latin squares by proving that every proper partial edge coloring of at most (d-1) edges of the d-dimensional hypercube Qd can be extended to a proper d-edge coloring of Qd. Additionally, we characterize which partial edge colorings of Qd with precisely d precolored edges are extendable to proper d-edge colorings of Qd.

• 21. Casselgren, Carl Johan
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik. Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Latin cubes with forbidden entries2019Ingår i: The Electronic Journal of Combinatorics, ISSN 1097-1440, E-ISSN 1077-8926, Vol. 26, nr 1, artikel-id P1.2Artikel i tidskrift (Refereegranskat)

We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant y>0 such that if n=2k and A is a 3-dimensional n×n×n array where every cell contains at most γn symbols, and every symbol occurs at most γn times in every line of A, then A is avoidable; that is, there is a Latin cube L of order n such that for every 1 ≤ i,j,k ≤ n, the symbol in position (i,j,k) of L does not appear in the corresponding cell of A.

• 22. Casselgren, Carl Johan
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik. Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Restricted extension of sparse partial edge colorings of hypercubesManuskript (preprint) (Övrigt vetenskapligt)

We consider the following type of question: Given a partial proper d-edge coloring of the d-dimensional hypercube Qd, and lists of allowed colors for the non-colored edges of Qd, can we extend the partial coloring to a proper d-edge coloring using only colors from the lists? We prove that this question has a positive answer in the case when both the partial coloring and the color lists satisfy certain sparsity conditions.

• 23. Casselgren, Carl Johan
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Latin cubes of even order with forbidden entriesManuskript (preprint) (Övrigt vetenskapligt)

We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant γ>0 such that if n=2t and A is a 3-dimensional n×n×n array where every cell contains at most γn symbols, and every symbol occurs at most γn times in every line of A, then A is avoidable; that is, there is a Latin cube L of order n such that for every 1≤i,j,k≤n, the symbol in position (i,j,k) of L does not appear in the corresponding cell of A.

• 24.
School of Computing and Mathematics, UCLan Cyprus, Pyla, Cyprus.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
The thresholds for diameter 2 in random Cayley graphs2014Ingår i: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 45, nr 2, s. 218-235Artikel i tidskrift (Refereegranskat)

Given a group G, the model G(G,p) denotes the probability space of all Cayley graphs of G where each element of the generating set is chosen independently at random with probability p. In this article we show that for any epsilon>0 and any family of groups G(k) of order n(k) for which nk, a graph kG(Gk,p) with high probability has diameter at most 2 if p(2+epsilon)lognknk and with high probability has diameter greater than 2 if p(14+epsilon)lognknk. We also provide examples of families of graphs which show that both of these results are best possible. Of particular interest is that for some families of groups, the corresponding random Cayley graphs achieve Diameter 2 significantly faster than the Erds-Renyi random graphs.

• 25.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Matematiska institutionen. Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, USA.
Unavoidable subgraphs of colored graphs2008Ingår i: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 308, nr 19, s. 4396-4413Artikel i tidskrift (Refereegranskat)

A natural generalization of graph Ramsey theory is the study of unavoidable sub-graphs in large colored graphs. In this paper. we find a minimal family of unavoidable graphs in two-edge-colored graphs. Namely, for a positive even integer k, let y(k) be the family of two-edge-colored graphs on k vertices such that one of the colors forms either two disjoint K-k/2's or simply one K-k/2. Bollobas conjectured that for all k and epsilon > 0, there exists an n(k, epsilon) such that if n >= n(k, epsilon) then every two-edge-coloring of K-n, in which the density of each color is at least epsilon, contains a member of this family. We solve this conjecture and present a series of results bounding it (k, s) for different ranges of epsilon. In particular, if epsilon is sufficiently close to 1/2, the gap between out upper and lower bounds for n(k, epsilon) is smaller than those for the classical Ramsey number R(k, k).

• 26. Cutler, Jonathan
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Latin squares with forbidden entries2004Rapport (Övrigt vetenskapligt)
• 27. Demetres, Christofides
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales2008Ingår i: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 32, nr 1, s. 88-100Artikel i tidskrift (Refereegranskat)

The Alon-Roichman theorem states that for every \$\ge > 0\$ there is a constant \$c(\ge)\$, such that the Cayley graph of a finite group \$G\$ with respect to \$c(\ge)\log{\abs{G}}\$ elements of \$G\$, chosen independently and uniformly at random, has expected second largest eigenvalue less than \$\ge\$. In particular, such a graph is an expander with high probability.

Landau and Russell, and independently Loh and Schulman, improved the bounds of the theorem. Following Landau and Russell we give a simpler proof of the result, improving the bounds even further. When considered for a general group \$G\$, our bounds are in a sense best possible.

We also give a generalisation of the Alon-Roichman theorem to random coset graphs.

• 28.
Austin Peay State University.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Extending partial latin cubes2014Ingår i: Ars combinatoria, ISSN 0381-7032, Vol. 113, s. 405-414Artikel i tidskrift (Refereegranskat)

In the spirit of Ryser's theorem, we prove sufficient conditions on k, and m so that k xexm Latin boxes, i.e. partial Latin cubes whose filled cells form a k x x m rectangular box, can be extended to akxnxm latin box, and also to akxnxn latin box, where n is the number of symbols used, and likewise the order of the Latin cube. We also prove a partial Evans type result for Latin cubes, namely that any partial Latin cube of order n with at most n 1 filled cells is completable, given certain conditions on the spatial distribution of the filled cells.

• 29.
Computer Science Institute, University of Halle Wittenberg, Germany .
Computer Science Institute, University of Halle Wittenberg, Germany . Computer Science Institute, University of Halle Wittenberg, Germany . Computer Science Institute, University of Halle Wittenberg, Germany . Computer Science Institute, University of Halle Wittenberg, Germany .
Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones2009Ingår i: Proceedings of 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009) / [ed] Sonia Cafieri, Antonio Mucherino, Giacomo Nannicini, Fabien Tarissan and Leo Liberti, 2009, s. 3-6Konferensbidrag (Refereegranskat)

We present two approaches for the Euclidean TSP which compute high quality tours for large instances. Both approaches are based on pseudo backbones consisting of all common edges of good tours. The first approach starts with some pre-computed good tours. Using this approach we found record tours for seven VLSI instances. The second approach is window based and constructs from scratch very good tours of huge TSPinstances, e. g., the World TSP.

• 30.
Computer Science Institute, University of Halle-Wittenberg, Germany.
Computer Science Institute, University of Halle-Wittenberg, Germany. Computer Science Institute, University of Halle-Wittenberg, Germany. Computer Science Institute, University of Halle-Wittenberg, Germany.
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges2009Ingår i: Proceedings of 5th International Conference on Algorithmic Aspects in Information and Management (AAIM 2009) / [ed] A. Goldberg and Y. Zhou, Berlin-Heidelberg: Springer , 2009, s. 175-187Konferensbidrag (Refereegranskat)

We introduce a reduction technique for the well-known TSP. The basic idea of the approach consists of transforming a TSP instance to another one with smaller size by contracting pseudo backbone edges computed in a preprocessing step, where pseudo backbone edges are edges which are likely to be in an optimal tour. A tour of the small instance can be re-transformed to a tour of the original instance. We experimentally investigated TSP benchmark instances by our reduction technique combined with the currently leading TSP heuristic of Helsgaun. The results strongly demonstrate the effectivity of this reduction technique: for the six VLSI instances xvb13584, pjh17845, fnc19402, ido21215, boa28924, and fht47608 we could set world records, i.e., find better tours than the effective reduction of the problem size so that we can search the more important tour subspace more intensively.

• 31.
Computer Science Institute, Christian-Albrechts-University of Kiel, Germany.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
The b-Matching Problem in Hypergraphs: Hardness and Approximability2012Ingår i: COCOA 2012: Combinatorial Optimization and Applications / [ed] Guohui Lin, Berlin-Heidelberg: Springer Berlin-Heidelberg , 2012, s. 200-211Konferensbidrag (Refereegranskat)

In this paper we analyze the maximum cardinality b-matching problem in l-uniform hypergraphs with respect to the complexity class Max-Snp, where b-matching is defined as follows: for given b ∈ ℕ and a hypergraph H=(V,E)" role="presentation" style="box-sizing: border-box; display: inline-table; line-height: normal; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; position: relative;">H=(V,E)H=(V,E) a subset Mb&#x2286;E" role="presentation" style="box-sizing: border-box; display: inline-table; line-height: normal; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; position: relative;">Mb⊆EMb⊆E with maximum cardinality is sought so that no vertex is contained in more than b hyperedges of M b . We show that if the maximum degree of the vertices is bounded by a constant B ∈ ℕ , this problem has no approximation scheme, unless P=NP" role="presentation" style="box-sizing: border-box; display: inline-table; line-height: normal; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; position: relative;">P=NPP=NP. This result generalizes a result of Kann from b = 1 to the case that b ∈ ℕ with 0&lt;b&#x2264;B3" role="presentation" style="box-sizing: border-box; display: inline-table; line-height: normal; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; position: relative;">0<b≤B30<b≤B3. Furthermore, we extend a result of Srivastav and Stangier, who gave an approximation algorithm for the unweighted b-matching problem.

• 32.
Martin-Luther-University Halle-Wittenberg, Germany and GISA GmbH, D-06112 Halle (Saale), Germany.
Martin-Luther-University Halle-Wittenberg, Germany. Martin-Luther-University Halle-Wittenberg, Germany and Christian-Albrechts-University Kiel, Germany. Martin-Luther-University Halle-Wittenberg, Germany. Martin-Luther-University Halle-Wittenberg, Germany.
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction2010Ingår i: Proceedings of 6th International Conference on Algorithmic Aspects in Information and Management (AAIM 2010) / [ed] B. Chen, Berlin-Heidelberg: Springer , 2010, Vol. 6124, s. 119-130Konferensbidrag (Refereegranskat)

This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesman Problem (TSP). The basic idea of the approach consists of iteratively transforming the TSP instance to another one with smaller size by contracting pseudo backbone edges. The iteration is stopped, if the new TSP instance is small enough for directly applying an exact algorithm or an efficient TSP heuristic. The pseudo backbone edges of each iteration are computed by a window based technique in which the TSP instance is tiled in non-disjoint sub-instances. For each of these sub-instances a good tour is computed, independently of the other sub-instances. An edge which is contained in the computed tour of every sub-instance (of the current iteration) containing this edge is denoted to be a pseudo backbone edge. Paths of pseudo-backbone edges are contracted to single edges which are fixed during the subsequent process.

• 33.
School of Mathematical Sciences Queen Mary University of London, London E1 4NS, UK.
Minimal weight in union-closed families2011Ingår i: The Electronic Journal of Combinatorics, ISSN 1097-1440, E-ISSN 1077-8926, Vol. 18, nr 1, s. P95-Artikel i tidskrift (Refereegranskat)

Let Omega be a finite set and let S subset of P(Omega) be a set system on Omega. For x is an element of Omega, we denote by d(S)(x) the number of members of S containing x.Along-standing conjecture of Frankl states that if S is union-closed then there is some x is an element of Omega with d(S)(x)>= 1/2|S|. We consider a related question. Define the weight of a family S to be w(S) := A.S|A|.SupposeSisunion-closed. How small can w(S) be? Reimer showed w(S) >= 1/2|S|log(2)|S|, and that this inequality is tight. In this paper we show how Reimer's bound may be improved if we have some additional information about the domain Omega of S: if S separates the points of its domain, then w(S) >= ((vertical bar Omega vertical bar)(2)). This is stronger than Reimer's Theorem when |Omega| > root|S|log(2)|S|. In addition we constructa family of examples showing the combined bound on w(S)istightexcept in the region |Omega| = Theta(root|S|log(2)|S|), where it may be off by a multiplicative factor of 2. Our proof also gives a lower bound on the average degree: if S is a point-separating union-closed family on Omega, then 1/ |Omega|Sigma(x is an element of Omega)d(S)(x)>= 1/2 root|S|log(2)|S| broken vertical bar O(1), and this is best possible except for a multiplicative factor of 2.

• 34.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Sperner's Problem for G-Independent Families2015Ingår i: Combinatorics, probability & computing, ISSN 0963-5483, E-ISSN 1469-2163, Vol. 24, nr 3, s. 528-550Artikel i tidskrift (Refereegranskat)

Given a graph G, let Q(G) denote the collection of all independent (edge-free) sets of vertices in G. We consider the problem of determining the size of a largest antichain in Q(G). When G is the edgeless graph, this problem is resolved by Sperner's theorem. In this paper, we focus on the case where G is the path of length n - 1, proving that the size of a maximal antichain is of the same order as the size of a largest layer of Q(G).

• 35. Falgas-Ravry, Victor
Separating path systems2014Ingår i: Journal of Combinatorics, ISSN 2156-3527, E-ISSN 2150-959X, Vol. 5, nr 3, s. 335-354Artikel i tidskrift (Refereegranskat)

We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every nn-vertex graph admits a separating path system of size linear in nn and we prove this in certain interesting special cases. In particular, we establish this conjecture for random graphs and graphs with linear minimum degree. We also obtain tight bounds on the size of a minimal separating path system in the case of trees.

• 36. Falgas-Ravry, Victor
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik. Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Speed and concentration of the covering time for structured coupon collectorsManuskript (preprint) (Övrigt vetenskapligt)

Let be an n-set, and let be a random variable taking values in the powerset of V. Suppose we are given a sequence of random coupons X1,X2,…, where the Xi are independent random variables with distribution given by X. The covering time T is the smallest integer t≥0 such that ⋃ti=1Xi=V. The distribution of T is important in many applications in combinatorial probability, and has been extensively studied. However the literature has focussed almost exclusively on the case where X is assumed to be symmetric and/or uniform in some way.

In this paper we study the covering time for much more general random variables X; we give general criteria for being sharply concentrated around its mean, precise tools to estimate that mean, as well as examples where fails to be concentrated and when structural properties in the distribution of allow for a very different behaviour of relative to the symmetric/uniform case.

• 37.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Subgraphs with large minimum ℓ-degree in hypergraphs where almost all ℓ-degrees are large2018Ingår i: The Electronic Journal of Combinatorics, ISSN 1097-1440, E-ISSN 1077-8926, Vol. 25, nr 2, artikel-id P2.18Artikel i tidskrift (Refereegranskat)

Let G be an r-uniform hypergraph on n vertices such that all but at most ε(n ℓ) ℓ-subsets of vertices have degree at least p(n-ℓ r-ℓ). We show that G contains a large subgraph with high minimum ℓ-degree.

• 38.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Multicolor containers, extremal entropy, and counting2019Ingår i: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 54, nr 4, s. 676-720Artikel i tidskrift (Refereegranskat)

In breakthrough results, Saxton-Thomason and Balogh-Morris-Samotij developed powerful theories of hypergraph containers. In this paper, we explore some consequences of these theories. We use a simple container theorem of Saxton-Thomason and an entropy-based framework to deduce container and counting theorems for hereditary properties of k-colorings of very general objects, which include both vertex- and edge-colorings of general hypergraph sequences as special cases. In the case of sequences of complete graphs, we further derive characterization and transference results for hereditary properties in terms of their stability families and extremal entropy. This covers within a unified framework a great variety of combinatorial structures, some of which had not previously been studied via containers: directed graphs, oriented graphs, tournaments, multigraphs with bounded multiplicity, and multicolored graphs among others. Similar results were recently and independently obtained by Terry.

• 39.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Codegree thresholds for covering 3-uniform hypergraphs2016Ingår i: SIAM Journal on Discrete Mathematics, ISSN 0895-4801, E-ISSN 1095-7146, Vol. 30, nr 4, s. 1899-1917Artikel i tidskrift (Refereegranskat)

Given two 3-uniform hypergraphs F and G = (V, E), we say that G has an F-covering if we can cover V with copies of F. The minimum codegree of G is the largest integer d such that every pair of vertices from V is contained in at least d triples from E. Define c(2)(n, F) to be the largest minimum codegree among all n-vertex 3-graphs G that contain no F-covering. Determining c(2)(n, F) is a natural problem intermediate (but distinct) from the well-studied Turan problems and tiling problems. In this paper, we determine c(2)(n, K-4) (for n > 98) and the associated extremal configurations (for n > 998), where K-4 denotes the complete 3-graph on 4 vertices. We also obtain bounds on c(2)(n, F) which are apart by at most 2 in the cases where F is K-4(-) (K-4 with one edge removed), K-5(-), and the tight cycle C-5 on 5 vertices.

• 40. Fleischner, Herbert
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
Circuit double covers in special types of cubic graphs2009Ingår i: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 309, nr 18, s. 5724-5728Artikel i tidskrift (Refereegranskat)

Suppose that a 2-connected cubic graph G of order n has a circuit C of length at least n−4 such that GV(C) is connected. We show that G has a circuit double cover containing a prescribed set of circuits which satisfy certain conditions. It follows that hypohamiltonian cubic graphs (i.e., non-hamiltonian cubic graphs G such that Gv is hamiltonian for every vV(G)) have strong circuit double covers.

• 41.
Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, Chicago, IL, 60607-7045, USA; Berlin Mathematical School, Berlin, Germany.
Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, Chicago, IL, 60607-7045, USA . Department of Physics, AlbaNova University Center, KTH, 106 91, Stockholm, Sweden . Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
On the Validations of the Asymptotic Matching Conjectures2008Ingår i: Journal of statistical physics, ISSN 0022-4715, E-ISSN 1572-9613, Vol. 133, nr 3, s. 513-533Artikel i tidskrift (Refereegranskat)

In this paper we review the asymptotic matching conjectures for r-regular bipartite graphs, and their connections in estimating the monomer-dimer entropies in d-dimensional integer lattice and Bethe lattices. We prove new rigorous upper and lower bounds for the monomer-dimer entropies, which support these conjectures. We describe a general construction of infinite families of r-regular tori graphs and give algorithms for computing the monomer-dimer entropy of density p, for any p is an element of[0,1], for these graphs. Finally we use tori graphs to test the asymptotic matching conjectures for certain infinite r-regular bipartite graphs.

• 42. Friedland, S.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
On the number of matching in regular graphs2008Ingår i: The Electronic Journal of Combinatorics, ISSN 1097-1440, E-ISSN 1077-8926, Vol. 15, nr 1Artikel i tidskrift (Refereegranskat)

For the set of graphs with a given degree sequence, consisting of any number of 2's and 1's, and its subset of bipartite graphs, we characterize the optimal graphs who maximize and minimize the number of m-matchings. We find the expected value of the number of m-matchings of r-regular bipartite graphs on 2n veritces with respect to the two standard measures. We state and discuss the conjectured upper and lower bounds for m-matchings in r-regular bipartite graphs on 2n vertices, and their asymptotic versions for infinite r-regular bipartite graphs. We prove these conjectures for 2-regular bipartite graphs and for m-matchings with m <= 4.

• 43. Friedland, S.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
On the number of matchings in regular graphs2008Ingår i: The Electronic Journal of Combinatorics, ISSN 1097-1440, E-ISSN 1077-8926, Vol. 15, nr 1Artikel i tidskrift (Refereegranskat)
• 44.
Faculty to Economics Sciences, University of Groningen, the Netherlands and Department of Applied Mathematics, Khmelnitsky National University, Ukraine. Department of Computer Science, Royal Holloway University of London, UK and Department of Computer Science, University of Haifa, Israel. Computer Science Institute, University of Halle-Wittenberg, Germany.
Improving the Performance of Greedy Heuristics for TSPs Using Tolerances2007Ingår i: Communications in Dependability and Quality Management, Vol. 10, nr 1, s. 52-70Artikel i tidskrift (Refereegranskat)

In this paper we introduce three greedy algorithms for the traveling salesman problem. These algorithms are unique in that they use arc tolerances, rather than arc weights, to decide whether or not to include an arx in a solution. We report extensive computational experiments on benchmark instances that clearly demonstrate that our tolerance-based algorithms outperform their weight-based counterpart. Along with other papers dealing with the Assignment Problem, this paper indicates that the potential for using tolerance-based algorithms for various optimization problems is high and motivates further investigation of the approach. We recommend one of our algorithms as a significantly better alternative to the weight-based greedy, which is often used to produce initial TSP tours.

• 45.
Faculty of Economic Sciences, University of Groningen, The Netherlands. Department of Computer Science, Royal Holloway University of London, UK and Department of Computer Science, University of Haifa, Israel. Computer Science Institute, University of Halle-Wittenberg, Germany.
Tolerance-based algorithms for the traveling salesman problem2008Ingår i: Mathematical Programming and Game Theory for Decision Making / [ed] S.K. Neogy, R.B. Bapat, A.K. Das, and T. Parthasarathy, New Jersey: World Scientific, 2008, s. 47-59Kapitel i bok, del av antologi (Refereegranskat)

Most research on algorithms for combinatorial optimization use the costs of the elements in the ground set for making decisions about the solutions that the algorithms would output. For traveling salesman problems, this implies that algorithms generally use arc lengths to decide on whether an arc is included in a partial solution or not. In this paper we study the eect of using element tolerances for making these decisions. We choose the traveling salesman problem as a model combinatorial optimization problem and propose several greedy algorithms for it based on tolerances. We report extensive computational experiments on benchmark instances that clearly demonstrate that our tolerance-based algorithms outperform their weight-based counterpart. This indicates that the potential for using tolerance-based algorithms for various optimization problems is high and motivates further investigation of the approach.

• 46.
Christian-Albrechts Universität Kiel.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik. Christian-Albrechts Universität Kiel. Christian-Albrechts Universität Kiel.
Bounds for Static Black-Peg AB Mastermind2017Ingår i: COCOA 2017: Combinatorial Optimization and Applications, Springer Berlin/Heidelberg, 2017, s. 409-424Konferensbidrag (Refereegranskat)

Mastermind is a famous two-player game introduced by M. Meirowitz (1970). Its combinatorics has gained increased interest over the last years   for different variants.

In this paper we consider a version known as the Black-Peg AB Game, where one player creates a secret code consisting of c colors on p <= c pegs, where each color is used at most once. The second player tries to guess the secret code with as few questions as possible. For each question he receives the number of correctly placed colors. In the static variant the second player doesn't receive the answers one at a time,  but all at once after asking the last question.  There are several results both for the AB and the static version, but the combination of both versions has not been considered so far. The most prominent case is n:=p=c, where the secret code and all questions are permutations. The main result of this paper is an upper bound of O(n^{1.525}) questions for this setting. With a slight modification of the arguments of Doerr et al. (2016) we also give a lower bound of \Omega(n\log n). Furthermore, we complement the upper bound for p=c  by an optimal (\lceil 4c/3 \rceil -1)-strategy for the special case p=2 and arbitrary c >= 2 and list optimal strategies for six additional pairs (p,c) .

• 47.
Department of Econometrics and Operations Research, University of Groningen, The Netherlands.
Computer Science Institute, Martin-Luther-University, Halle-Wittenberg, Germany.
How To Make a Greedy Heuristic for the Asymmetric Traveling Salesman Problem Competitive2005Rapport (Refereegranskat)

It is widely confirmed by many computational experiments that a greedy type heuristics for the Traveling Salesman Problem (TSP) produces rather poor solutions except for the Euclidean TSP. The selection of arcs to be included by a greedy heuristic is usually done on the base of cost values. We propose to use upper tolerances of an optimal solution to one of the relaxed Asymmetric TSP (ATSP) to guide the selection of an arc to be included in the final greedy solution. Even though it needs time to calculate tolerances, our computational experiments for the wide range of ATSP instances show that tolerance based greedy heuristics is much more accurate and faster than previously reported greedy type algorithms.

• 48.
Faculty of Economics and Business, University of Groningen, The Netherlands.
Computer Science Institute, University of Halle-Wittenberg, D-06099 Halle (Saale), Germany.
The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem2008Ingår i: Algorithmic Operations Research, ISSN 1718-3235, Vol. 3, nr 1, s. 79-81Artikel i tidskrift (Refereegranskat)

Ji et al. have conjectured that using the matrix form (to represent a basic solution) instead of the Simplex tableau in the dual Simplex method will lead to an algorithm with the time complexity comparable to the Hungarian algorithm for solving the Assignment Problem. In this note we show that both the time complexity and the CPU times of the Ji et al. algorithm are far away from being competitive to the Hungarian algorithm.

• 49.
Faculty of Economic Sciences, University of Groningen, The Netherlands and Department of Applied Mathematics, Khmelnitsky National University, Ukraine.
University of Halle-Wittenberg, Computer Science Institute, Germany. University of Halle-Wittenberg, Computer Science Institute, Germany.
Some Basics on Tolerances2006Ingår i: Proceedings of 2nd International Conference on Alghorithmic Aspects in Information and Management (AAIM 2006) / [ed] S.-W. Cheng and C.K. Poon, Berlin-Heidelberg: Springer Berlin/Heidelberg, 2006, s. 194-206Konferensbidrag (Refereegranskat)

In this paper we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (Σ,∏,MAX) we give some basic properties on upper and lower tolerances. We show that the upper tolerance of an element is well defined, how to compute the upper tolerance of an element, and give equivalent formulations when the upper tolerance is +∞ or > 0. Analogous results are given for the lower tolerance and some results on the relationship between lower and upper tolerances are given.

• 50.
Faculty of Economic Sciences, University of Groningen, The Netherlands and Department of Applied Mathematics, Khmelnitsky National University, Ukraine.
Computer Science Institute, University of Halle-Wittenberg, Germany. Computer Science Institute, University of Halle-Wittenberg, Germany.
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP2006Ingår i: Proceedings of 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2006) / [ed] T. Erlebach, Berlin-Heidelberg: Springer Berlin/Heidelberg, 2006, s. 86-97Konferensbidrag (Refereegranskat)

In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heuristic. Our improvement is based on replacing the selection of each path to be contracted after deleting a heaviest arc from each short cycle in an Optimal Assignment Problem Solution (OAPS) by contracting a single arc from a short cycle in an OAPS with the largest upper tolerance with respect to one of the relaxed ATSP. The improved algorithm produces higher-quality tours than all previous COP versions and is clearly outperforming all other construction heuristics on robustness.

123 1 - 50 av 132
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
• apa
• ieee
• modern-language-association-8th-edition
• vancouver
• Annat format
Fler format
Språk
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Annat språk
Fler språk
Utmatningsformat
• html
• text
• asciidoc
• rtf