|
|||||||
|
|
Workshop on Approximation and Online Algorithms 2013 - Accepted papers
Min-Sum $2$-Paths Problems Low Dimensional Embeddings of Doubling Metrics Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation On the Max Min Vertex Cover problem Capacitated Network Design Problems: Hardness, Approximation Algorithms, and Connections to Group Steiner Tree Approximating the Quadratic Knapsack Problem on Special Graph Classes Approximating the Sparsest k-Subgraph in Chordal Graphs Improved approximation algorithm for $k$-level UFL (with penalties), a simplistic view on randomizing the scaling parameter Inapproximability results for graph convexity parameters Continuum armed bandit problem of few variables in high dimensions Approximability of Connected Factors Reordering Buffer Management with Advice Online Knapsack Revisited Counting approximately-shortest paths in directed acyclic graphs
|
||||||
|
|
||||||
| webmaster - credits | |||||||