Pages that link to "Item:Q2830052"
From MaRDI portal
The following pages link to Algorithmic Aspects in Information and Management (Q2830052):
Displaying 50 items.
- Comparison of Two Algorithms for Computing Page Importance (Q3578354) (← links)
- Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data (Q3578355) (← links)
- The (K,k)-Capacitated Spanning Tree Problem (Q3578356) (← links)
- Optimal Algorithms for the Economic Lot-Sizing Problem with Multi-supplier (Q3578357) (← links)
- Computing Exact and Approximate Nash Equilibria in 2-Player Games (Q3578358) (← links)
- Approximating Maximum Edge 2-Coloring in Simple Graphs (Q3578359) (← links)
- A Linear Kernel for Co-Path/Cycle Packing (Q3578360) (← links)
- A VaR Algorithm for Warrants Portfolio (Q3578361) (← links)
- Some Results on Incremental Vertex Cover Problem (Q3578362) (← links)
- Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction (Q3578366) (← links)
- Point Location in the Continuous-Time Moving Network (Q3578367) (← links)
- Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints (Q3578368) (← links)
- Inverse 1-median Problem on Trees under Weighted l ∞ Norm (Q3578369) (← links)
- On the Approximability of the Vertex Cover and Related Problems (Q3578370) (← links)
- Feasibility Testing for Dial-a-Ride Problems (Q3578371) (← links)
- Indexing Similar DNA Sequences (Q3578373) (← links)
- Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint (Q3578374) (← links)
- A New Smoothing Newton Method for Symmetric Cone Complementarity Problems (Q3578375) (← links)
- Approximation Algorithms for Scheduling with a Variable Machine Maintenance (Q3578376) (← links)
- Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines (Q3578377) (← links)
- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles (Q3578378) (← links)
- Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive (Q3578379) (← links)
- A Primal-Dual Approximation Algorithm for the k-Level Stochastic Facility Location Problem (Q3578380) (← links)
- Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision (Q3578381) (← links)
- Varieties of Regularities in Weighted Sequences (Q3578382) (← links)
- Online Uniformly Inserting Points on Grid (Q3578383) (← links)
- Kernelization for Cycle Transversal Problems (Q3578384) (← links)
- Online Splitting Interval Scheduling on m Identical Machines (Q3578385) (← links)
- Extended Tabu Search on Fuzzy Traveling Salesman Problem in Multi-criteria Analysis (Q3578386) (← links)
- Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery (Q3578387) (← links)
- Algorithmic Challenge in Online Advertising (Q3638436) (← links)
- Parallel Algorithms for Collaborative Filtering (Q3638437) (← links)
- On the Approximability of Some Haplotyping Problems (Q3638438) (← links)
- On Acyclicity of Games with Cycles (Q3638439) (← links)
- Discrete online TSP (Q3638442) (← links)
- On Approximating an Implicit Cover Problem in Biology (Q3638443) (← links)
- Power Indices in Spanning Connectivity Games (Q3638444) (← links)
- Efficiently Generating k-Best Solutions to Procurement Auctions (Q3638445) (← links)
- Line Segment Facility Location in Weighted Subdivisions (Q3638446) (← links)
- Algorithms for Placing Monitors in a Flow Network (Q3638447) (← links)
- Three Results on Frequency Assignment in Linear Cellular Networks (Q3638448) (← links)
- Link Distance and Shortest Path Problems in the Plane (Q3638449) (← links)
- Equiseparability on Terminal Wiener Index (Q3638450) (← links)
- A Note on Estimating Hybrid Frequency Moment of Data Streams (Q3638451) (← links)
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing (Q3638452) (← links)
- Dynamic Position Auctions with Consumer Search (Q3638453) (← links)
- Nonlinear Optimization over a Weighted Independence System (Q3638454) (← links)
- Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers (Q3638455) (← links)
- Latency Constrained Aggregation in Chain Networks Admits a PTAS (Q3638456) (← links)
- Cutting a Cake for Five People (Q3638457) (← links)
