ALGORITHMICA 2008 | Sciweavers

We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an error of at most using as...

Ilya Baran, Erik D. Demaine, Dmitriy A. Katz

claim paper

Read More »

30

click to vote

ALGORITHMICA
2008

91views more ALGORITHMICA 2008»

Average Case Analysis of Bounded Space Bin Packing Algorithms

13 years 11 months ago

Download webee.technion.ac.il

Nir Naaman, Raphael Rom

claim paper

Read More »

31

click to vote

ALGORITHMICA
2008

63views more ALGORITHMICA 2008»

The Swap Edges of a Multiple-Sources Routing Tree

13 years 11 months ago

Download www.csie.ntu.edu.tw

Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...

Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao

claim paper

Read More »

43

click to vote

ALGORITHMICA
2008

142views more ALGORITHMICA 2008»

New Linear-Time Algorithms for Edge-Coloring Planar Graphs

13 years 11 months ago

Download cs.nyu.edu

We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...

Richard Cole, Lukasz Kowalik

claim paper

Read More »

31

click to vote

ALGORITHMICA
2008

52views more ALGORITHMICA 2008»

From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time

13 years 11 months ago

Download www.lirmm.fr

We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...

V. Berry, Z. S. Peng, H. F. Ting

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers