Sciweavers

4526 search results - page 147 / 906
» Algorithmic problems related to the Internet
Sort
View
CIAC
2010
Springer
282views Algorithms» more  CIAC 2010»
15 years 7 months ago
Improved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Mo...
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 10 months ago
Near-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
Jason D. Hartline, Vladlen Koltun
AI
2007
Springer
15 years 4 months ago
Determining the consistency of partial tree descriptions
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
Manuel Bodirsky, Martin Kutz
SIGCSE
2006
ACM
127views Education» more  SIGCSE 2006»
15 years 10 months ago
SNITCH: a software tool for detecting cut and paste plagiarism
Plagiarism of material from the Internet is a widespread and growing problem. Computer science students, and those in other science and engineering courses, can sometimes get away...
Sebastian Niezgoda, Thomas P. Way
INFOCOM
2005
IEEE
15 years 10 months ago
Farsighted users harness network time-diversity
Abstract— Fluctuations in network conditions are a common phenomenon. They arise in the current wired Internet due to changes in demand, and in wireless networks due to changing ...
Peter B. Key, Laurent Massoulié, Milan Vojn...