TALG 2010 - PDF Preprint Papers

TALG 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TALG-2010 Paper

click to vote

TALG
2010

236views more TALG 2010»

Length-bounded cuts and flows

13 years 7 months ago

Download kam.mff.cuni.cz

Georg Baier, Thomas Erlebach, Alexander Hall, Ekke...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	236	Length-bounded cuts and flows	claim
2	158	Clustering for metric and nonmetric distance measures	claim
3	123	Lower-bounded facility location	claim
4	110	Approximating fractional hypertree width	claim
5	109	Facility location with hierarchical facility costs	claim
6	107	Finding equitable convex partitions of points in a polygon efficiently	claim
7	102	An approximation algorithm for the maximum leaf spanning arborescence problem	claim
8	101	Reasoning about online algorithms with weighted automata	claim
9	96	The compressed permuterm index	claim
10	95	How to probe for an extreme value	claim
11	93	Efficient algorithms for the 2-gathering problem	claim
12	93	Distributed error confinement	claim
13	86	Approximating corridors and tours via restriction and relaxation techniques	claim
14	83	Finding shortest contractible and shortest separating cycles in embedded graphs	claim
15	82	A near-optimal algorithm for estimating the entropy of a stream	claim
16	74	Comparison-based time-space lower bounds for selection	claim
17	73	Discounted deterministic Markov decision processes and discounted all-pairs shortest paths	claim
18	68	A fast algorithm to generate open meandric systems and meanders	claim
19	66	Competitive weighted throughput analysis of greedy protocols on DAGs	claim
20	65	Maximal biconnected subgraphs of random planar graphs	claim
21	59	Optimization problems in multiple-interval graphs	claim
22	52	Approximating the distance to monotonicity in high dimensions	claim
23	48	Geodesic delaunay triangulations in bounded planar domains	claim
24	46	Approximate shared-memory counting despite a strong adversary	claim
25	38	Ordering by weighted number of wins gives a good ranking for weighted tournaments	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers