Sciweavers

Share
ESA
2005
Springer
99views Algorithms» more  ESA 2005»
9 years 9 months ago
Optimizing a 2D Function Satisfying Unimodality Properties
The number of probes needed by the best possible algorithm for locally or globally optimizing a bivariate function varies substantially depending on the assumptions made about the ...
Erik D. Demaine, Stefan Langerman
ESA
2005
Springer
76views Algorithms» more  ESA 2005»
9 years 9 months ago
The Complexity of Games on Highly Regular Graphs
Konstantinos Daskalakis, Christos H. Papadimitriou
ESA
2005
Springer
136views Algorithms» more  ESA 2005»
9 years 9 months ago
Approximating the 2-Interval Pattern Problem
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...
Maxime Crochemore, Danny Hermelin, Gad M. Landau, ...
ESA
2005
Springer
77views Algorithms» more  ESA 2005»
9 years 9 months ago
On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games
We consider the price of stability for Nash and correlated equilibria of linear congestion games. The price of stability is the optimistic price of anarchy, the ratio of the cost ...
George Christodoulou, Elias Koutsoupias
ESA
2005
Springer
98views Algorithms» more  ESA 2005»
9 years 9 months ago
Improved Approximation Algorithms for Metric Max TSP
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
Zhi-Zhong Chen, Takayuki Nagoya
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
9 years 9 months ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen
ESA
2005
Springer
95views Algorithms» more  ESA 2005»
9 years 9 months ago
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs
We present an algorithm for finding shortest surface non-separating cycles in graphs embedded on surfaces in O(g3/2 V 3/2 log V + g5/2 V 1/2 ) time, where V is the number of vert...
Sergio Cabello, Bojan Mohar
ESA
2005
Springer
105views Algorithms» more  ESA 2005»
9 years 9 months ago
Matching Point Sets with Respect to the Earth Mover's Distance
Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + ) and (2+ )-approximation algorithms for the minimum Euclidean Earth Mover’s Dis...
Sergio Cabello, Panos Giannopoulos, Christian Knau...
ESA
2005
Springer
125views Algorithms» more  ESA 2005»
9 years 9 months ago
Online Primal-Dual Algorithms for Covering and Packing Problems
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
Niv Buchbinder, Joseph Naor
ESA
2005
Springer
131views Algorithms» more  ESA 2005»
9 years 9 months ago
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...
books