Sciweavers

4843 search results - page 79 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
AMC
2005
112views more  AMC 2005»
15 years 2 months ago
Stieltjes moment problem via fractional moments
Stieltjes moment problem is considered to recover a probability density function from the knowledge of its infinite sequence of ordinary moments. The approximate density is obtain...
Pierluigi Novi Inverardi, Alberto Petri, Giorgio P...
MOC
2000
104views more  MOC 2000»
15 years 2 months ago
A domain embedding preconditioner for the Lagrange multiplier system
Abstract. Finite element approximations for the Dirichlet problem associated to a second
Einar Haug, Ragnar Winther
WADS
2007
Springer
189views Algorithms» more  WADS 2007»
15 years 9 months ago
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
Lukasz Kowalik, Marcin Mucha
APPROX
1998
Springer
150views Algorithms» more  APPROX 1998»
15 years 7 months ago
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
Vijay Kumar
AAAI
2008
15 years 5 months ago
Approximability of Manipulating Elections
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
Eric Brelsford, Piotr Faliszewski, Edith Hemaspaan...