Sciweavers

DAM
2010
120views more  DAM 2010»
13 years 4 months ago
A new approximation algorithm for the multilevel facility location problem
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren
DAM
2010
58views more  DAM 2010»
13 years 4 months ago
Finding the maximum and minimum elements with one lie
Dániel Gerbner, Dömötör P&aa...
DAM
2010
86views more  DAM 2010»
13 years 4 months ago
Minimum fill-in and treewidth of split+ke and split+kv graphs
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For t...
Federico Mancini
DAM
2010
107views more  DAM 2010»
13 years 4 months ago
Codes from lattice and related graphs, and permutation decoding
Codes of length n2 and dimension 2n - 1 or 2n - 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its l...
Jennifer D. Key, Bernardo Gabriel Rodrigues
DAM
2010
59views more  DAM 2010»
13 years 4 months ago
Local edge-connectivity augmentation in hypergraphs is NP-complete
Zoltán Király, Ben Cosh, Bill Jackso...
DAM
2010
99views more  DAM 2010»
13 years 4 months ago
Backbone colorings of graphs with bounded degree
Jozef Miskuf, Riste Skrekovski, Martin Tancer
DAM
2010
92views more  DAM 2010»
13 years 4 months ago
Average-case analysis of incremental topological ordering
Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates...
Deepak Ajwani, Tobias Friedrich
DAM
2010
56views more  DAM 2010»
13 years 4 months ago
Crossing minimization in extended level drawings of graphs
Christian Bachmaier, Hedi Buchner, Michael Forster...
DAM
2010
116views more  DAM 2010»
13 years 4 months ago
Minimum sum edge colorings of multicycles
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-...
DAM
2010
53views more  DAM 2010»
13 years 4 months ago
Minimum cut bases in undirected networks
Florentine Bunke, Horst W. Hamacher, Francesco Maf...