IPL 2000 - PDF Preprint Papers

IPL 2000

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPL-2000 Paper

click to vote

IPL
2000

146views more IPL 2000»

Better approximations for max TSP

13 years 4 months ago

Download www.ii.uni.wroc.pl

We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...

Refael Hassin, Shlomi Rubinstein

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	146	Better approximations for max TSP	claim
2	119	Cyclic-cubes and wrap-around butterflies	claim
3	115	Randomized uniform self-stabilizing mutual exclusion	claim
4	111	On the performance of the first-fit coloring algorithm on permutation graphs	claim
5	105	Coverings that preserve sense of direction	claim
6	101	Visual cryptography for grey level images	claim
7	98	Linear complexity of the Naor-Reingold pseudo-random function	claim
8	97	A fast algorithm for computing large Fibonacci numbers	claim
9	96	On bounded occurrence constraint satisfaction	claim
10	95	An efficient upper bound of the rotation distance of binary trees	claim
11	94	On rewrite constraints and context unification	claim
12	92	A general method to speed up fixed-parameter-tractable algorithms	claim
13	82	Estimating the number of vertices of a polyhedron	claim
14	78	Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms	claim
15	77	Simplified proof of the Fourier Sampling Theorem	claim
16	77	Efficient loopless generation of Gray codes for k-ary trees	claim
17	76	Deterministic small-world communication networks	claim
18	74	A new universal and fault-tolerant quantum basis	claim
19	72	Generalized interpolation in CASL	claim
20	69	Generating all maximal models of a Boolean expression	claim
21	62	Improved bounds for dictionary look-up with one error	claim
22	59	When does a correct mutual exclusion algorithm guarantee mutual exclusion?	claim
23	55	A fast cost scaling algorithm for submodular flow	claim
24	53	On the security of a convertible group signature scheme	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers