Sciweavers

545 search results - page 26 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
COMGEO
2008
ACM
13 years 8 months ago
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
Robert L. Scot Drysdale, Günter Rote, Astrid ...
CATS
2006
13 years 10 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
13 years 9 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
JACM
1998
88views more  JACM 1998»
13 years 8 months ago
A Threshold of ln n for Approximating Set Cover
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
Uriel Feige
HUC
2009
Springer
14 years 1 months ago
Simultaneous localization and mapping for pedestrians using only foot-mounted inertial sensors
In this paper we describe a new Bayesian estimation approach for simultaneous mapping and localization for pedestrians based on odometry with foot mounted inertial sensors. When s...
Patrick Robertson, Michael Angermann, Bernhard Kra...