Sciweavers

4843 search results - page 85 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
SCL
2008
109views more  SCL 2008»
14 years 10 months ago
A note on linear function approximation using random projections
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
Kishor Barman, Vivek S. Borkar
CORR
2010
Springer
122views Education» more  CORR 2010»
14 years 10 months ago
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
Deeparnab Chakrabarty, Chaitanya Swamy
EVOW
2009
Springer
14 years 7 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
ALGORITHMICA
2006
93views more  ALGORITHMICA 2006»
14 years 10 months ago
Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs
For multi-criteria problems and problems with poorly characterized objective, it is often desirable to simultaneously approximate the optimum solution for a large class of objecti...
Ashish Goel, Adam Meyerson
CAGD
2010
215views more  CAGD 2010»
14 years 10 months ago
Surface fitting and registration of point clouds using approximations of the unsigned distance function
Many problems in computer aided geometric design and geometry processing are stated as least
Simon Flöry, Michael Hofer