Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Srivastav, Anand - Institut für Informatik, Christian-Albrechts-Universität Kiel
Weighted Fractional and Integral k-Matching in Hypergraphs
DERANDOMIZATION IN COMBINATORIAL OPTIMIZATION
MULTI--COLOR DISCREPANCIES BENJAMIN DOERR AND ANAND SRIVASTAV
Institut fr Informatik Christian-Albrechts Universitt zu Kiel
On the Evolution of the Worst-Case OBDD Size Clemens Gropl
Recursive Randomized Coloring Beats Fair Dice Random Colorings
Discrepancy of Cartesian Products of Arithmetic Progressions
A Parallel Approximation Algorithm for Resource Constrained Scheduling and Bin Packing
On the bpartite Random Asymmetric Traveling Salesman Problem and its Assignment
On Complexity, Representation and Approximation of Integral Multicommodity Flows
Algorithmic ChernoffHoeffding Inequalities in Integer Programming zz
Experimental Study of Non-Oblivious Greedy and Randomized Rounding Algorithms
OneSided Discrepancy of Linear Hyperplanes in Finite Vector Spaces
The LovaszLocalLemma and Scheduling Anand Srivastav
Constructions of Sparse Asymmetric Connectors with Number Theoretic Methods
Tight Approximations for Resource Constrained Scheduling and Bin Packing
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Finding Dense Subgraphs with Semidefinite Programming
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem
The Price of Anarchy in Selfish Multicast Routing --Extended Abstract --
Models of Non-atomic Congestion Games From Unicast to Multicast Routing
paper.tex 3783 2009-09-29 14:05:13Z lki-desktop Bipartite Graph Matchings
Solving Generalized Maximum Dispersion with Linear Programming
Size and Structure of Random Ordered Binary Decision (Extended Abstract)
Blockwise Variable Orderings for Shared BDDs Harry Preu
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Approximation Algorithms for Pick-and-Place Anand Srivastav Hartmut Schroeter Christoph Michel yy
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
email: aba@numerik.unikiel.de email: asr@numerik.unikiel.de
