MFCS 2005 - PDF Preprint Papers

MFCS 2005 International Symposium on Mathematical Foundations of Computer

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed MFCS-2005 Paper

click to vote

MFCS
2005
Springer

182views Theoretical Computer Science» more MFCS 2005»

Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing

13 years 10 months ago

Download ls2-www.cs.uni-dortmund.de

We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...

Piotr Krysta

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	182	Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing	claim
2	143	Approximating Reversal Distance for Strings with Bounded Number of Duplicates	claim
3	138	Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time	claim
4	133	The Complexity of Model Checking Higher Order Fixpoint Logic	claim
5	131	Online Interval Coloring with Packing Constraints	claim
6	131	Inverse Monoids: Decidability and Complexity of Algebraic Questions	claim
7	123	Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix	claim
8	121	Concurrent Automata vs. Asynchronous Systems	claim
9	120	Tight Approximability Results for the Maximum Solution Equation Problem over Zp	claim
10	119	D-Width: A More Natural Measure for Directed Tree Width	claim
11	115	Autoreducibility, Mitoticity, and Immunity	claim
12	111	Basic Properties for Sand Automata	claim
13	109	Canonical Disjoint NP-Pairs of Propositional Proof Systems	claim
14	106	Combining Self-reducibility and Partial Information Algorithms	claim
15	100	Abstract Numeration Systems and Tilings	claim
16	100	On Beta-Shifts Having Arithmetical Languages	claim
17	98	Approximating Polygonal Objects by Deformable Smooth Surfaces	claim
18	98	Interactive Algorithms 2005	claim
19	98	An Invitation to Play	claim
20	94	Nondeterministic Graph Searching: From Pathwidth to Treewidth	claim
21	94	Explicit Inapproximability Bounds for the Shortest Superstring Problem	claim
22	92	Complexity of DNF and Isomorphism of Monotone Formulas	claim
23	91	Regular Sets of Higher-Order Pushdown Stacks	claim
24	90	A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs	claim
25	89	An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules	claim
26	89	Dimension Is Compression	claim
27	88	Page Migration in Dynamic Networks	claim
28	84	Shrinking Restarting Automata	claim
29	83	Adversarial Queueing Model for Continuous Network Dynamics	claim
30	80	Zeta-Dimension	claim
31	80	Online and Dynamic Recognition of Squarefree Strings	claim
32	80	The Generalization of Dirac's Theorem for Hypergraphs	claim
33	77	Strict Language Inequalities and Their Decision Problems	claim
34	75	On Small Hard Leaf Languages	claim
35	74	Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata	claim
36	74	Complexity Bounds for Regular Games	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers