9532 search results - page 164 / 1907 » Logic, Graphs, and Algorithms |
138
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
128
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
116
click to vote
GD
1994
Springer
15 years 8 months ago
1994
Springer
d Abstract and System Demonstration) Arne Frick , Andreas Ludwig, Heiko Mehldau Universit
142
click to vote
IMR
1998
Springer
15 years 8 months ago
1998
Springer
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be u...
141
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...