SIGAL 1990 | Sciweavers

38

SIGAL
1990

221views Algorithms» more SIGAL 1990»

Complexity Cores and Hard Problem Instances

14 years 3 months ago

Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...

Uwe Schöning

claim paper

Read More »

47

click to vote

SIGAL
1990

216views Algorithms» more SIGAL 1990»

Planar Separators and the Euclidean Norm

14 years 3 months ago

Download www.cs.cmu.edu

In this paper we show that every 2-connected embedded planar graph with faces of sizes

Hillel Gazit, Gary L. Miller

claim paper

Read More »

73

click to vote

SIGAL
1990

273views Algorithms» more SIGAL 1990»

Randomized Broadcast in Networks

14 years 3 months ago

Download www.mpi-inf.mpg.de

We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...

Uriel Feige, David Peleg, Prabhakar Raghavan, Eli ...

claim paper

Read More »

42

click to vote

SIGAL
1990

253views Algorithms» more SIGAL 1990»

Searching in Higher Dimension

14 years 3 months ago

Download www.cs.princeton.edu

Bernard Chazelle

claim paper