Sciweavers

82
Voted
DAM
2006
76views more  DAM 2006»
15 years 13 days ago
Minimum cost and list homomorphisms to semicomplete digraphs
Gregory Gutin, Arash Rafiey, Anders Yeo
47
Voted
DAM
2006
69views more  DAM 2006»
15 years 13 days ago
An algorithm to analyze stability of gene-expression patterns
Jutta Gebert, Martin Lätsch, Stefan Wolfgang ...
87
Voted
DAM
2006
102views more  DAM 2006»
15 years 13 days ago
A general two-sided matching market with discrete concave utility functions
Satoru Fujishige, Akihisa Tamura
DAM
2006
113views more  DAM 2006»
15 years 13 days ago
On the complexity of suboptimal decoding for list and decision feedback schemes
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and t...
Jürgen Freudenberger, Victor V. Zyablov
DAM
2006
73views more  DAM 2006»
15 years 13 days ago
Optimal on-line flow time with resource augmentation
Leah Epstein, Rob van Stee
77
Voted
DAM
2006
79views more  DAM 2006»
15 years 13 days ago
Edge ranking of weighted trees
: In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking of multitrees is NP-hard already for m...
Dariusz Dereniowski
113
Voted
DAM
2006
79views more  DAM 2006»
15 years 13 days ago
A simple expected running time analysis for randomized "divide and conquer" algorithms
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
Brian C. Dean
84
Voted
DAM
2006
116views more  DAM 2006»
15 years 13 days ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
DAM
2006
75views more  DAM 2006»
15 years 13 days ago
A greedy approximation algorithm for the group Steiner problem
Chandra Chekuri, Guy Even, Guy Kortsarz
83
Voted
DAM
2006
88views more  DAM 2006»
15 years 13 days ago
Finding nonnormal bent functions
The question if there exist nonnormal bent functions was an open question for several years. A Boolean function in n variables is called normal if there exists an affine subspace ...
Anne Canteaut, Magnus Daum, Hans Dobbertin, Gregor...