SWAT 2010 - PDF Preprint Papers

SWAT 2010 Scandinavian Workshop on Algorithm Theory

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SWAT-2010 Paper

click to vote

SWAT
2010
Springer

332views Algorithms» more SWAT 2010»

Improved Methods For Generating Quasi-gray Codes

13 years 8 months ago

Download cg.scs.carleton.ca

Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Mahe...

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	332	Improved Methods For Generating Quasi-gray Codes	claim
2	302	A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs	claim
3	294	Bin Packing with Fixed Number of Bins Revisited	claim
4	282	Better Bounds on Online Unit Clustering	claim
5	279	Online Function Tracking with Generalized Penalties	claim
6	276	Vector Bin Packing with Multiple-Choice	claim
7	270	Improved Algorithm for Degree Bounded Survivable Network Design Problem	claim
8	270	An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times	claim
9	269	Approximation Algorithms for Free-Label Maximization	claim
10	262	Strictly-Regular Number System and Data Structures	claim
11	260	Isomorphism for Graphs of Bounded Feedback Vertex Set Number	claim
12	256	The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition	claim
13	254	Faster Parameterized Algorithms for Minor Containment	claim
14	250	Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing	claim
15	242	Minimizing the Diameter of a Network Using Shortcut Edges	claim
16	241	Online Selection of Intervals and t-Intervals	claim
17	239	Capacitated max -Batching with Interval Graph Compatibilities	claim
18	234	Cops and Robber Game without Recharging	claim
19	222	Bregman Clustering for Separable Instances	claim
20	218	Optimal Exploration of Terrains with Obstacles	claim
21	207	Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput	claim
22	204	Feasible and Accurate Algorithms for Covering Semidefinite Programs	claim
23	203	The MST of Symmetric Disk Graphs Is Light	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers