Sciweavers

Share
ESA
2007
Springer
155views Algorithms» more  ESA 2007»
9 years 11 months ago
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
9 years 11 months ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
9 years 11 months ago
Finding Mobile Data: Efficiency vs. Location Inaccuracy
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
Amotz Bar-Noy, Joanna Klukowska
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
9 years 11 months ago
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
Khaled M. Elbassioni, René Sitters, Yan Zha...
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
9 years 11 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
ESA
2007
Springer
108views Algorithms» more  ESA 2007»
9 years 11 months ago
Optimal Resilient Dynamic Dictionaries
Gerth Stølting Brodal, Rolf Fagerberg, Iren...
ESA
2007
Springer
113views Algorithms» more  ESA 2007»
10 years 2 months ago
Distance Coloring
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
Alexa Sharp
ESA
2007
Springer
117views Algorithms» more  ESA 2007»
10 years 2 months ago
Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation
Emilio De Santis, Fabrizio Grandoni, Alessandro Pa...
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
10 years 2 months ago
Good Quality Virtual Realization of Unit Ball Graphs
Sriram V. Pemmaraju, Imran A. Pirwani
ESA
2007
Springer
121views Algorithms» more  ESA 2007»
10 years 2 months ago
Finding Frequent Elements in Non-bursty Streams
We present an algorithm for finding frequent elements in a stream where the arrivals are not bursty. Depending on the amount of burstiness in the stream our algorithm detects elem...
Rina Panigrahy, Dilys Thomas
books