Sciweavers

2266 search results - page 84 / 454
» Some Solutions to the Ignoring Problem
Sort
View
TCS
2008
15 years 1 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
TCS
1998
15 years 1 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
ATAL
2006
Springer
15 years 5 months ago
MDPOP: faithful distributed implementation of efficient social choice problems
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
Adrian Petcu, Boi Faltings, David C. Parkes
MP
2006
138views more  MP 2006»
15 years 1 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
TSP
2008
115views more  TSP 2008»
15 years 1 months ago
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi