Sciweavers

369 search results - page 26 / 74
» Approximation Algorithms for the Bi-criteria Weighted max-cu...
Sort
View
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
15 years 11 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom
JGAA
2006
63views more  JGAA 2006»
15 years 6 months ago
A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping
Two-dimensional phase unwrapping is the problem of deducing unambiguous "phase" from values known only modulo 2. Many authors agree that the objective of phase unwrappin...
Reuven Bar-Yehuda, Irad Yavneh
STACS
2007
Springer
16 years 20 days ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
16 years 6 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
JCO
2008
84views more  JCO 2008»
15 years 6 months ago
Partitioning a weighted partial order
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
Linda S. Moonen, Frits C. R. Spieksma