4843 search results - page 387 / 969 » The Shortcut Problem - Complexity and Approximation |
133
Voted
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...
121
click to vote
EMO
2003
Springer
15 years 9 months ago
2003
Springer
We present PICPA, a new algorithm for tackling constrained continuous multi-objective problems. The algorithm combines constraint propagation techniques and evolutionary concepts. ...
128
click to vote
SWAT
1994
Springer
15 years 8 months ago
1994
Springer
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
ACL
2004
15 years 6 months ago
2004
We present the first algorithm that computes optimal orderings of sentences into a locally coherent discourse. The algorithm runs very efficiently on a variety of coherence measur...
133
click to vote
ALENEX
2001
15 years 6 months ago
2001
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...