|
Algorithms for Network Design |
|
|
|
Polynomial Approximation Schemes for the Max-Min Allocation problem under a Grade of Service Provision |
|
|
1 | (13) |
|
|
|
|
|
|
|
A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices |
|
|
14 | (10) |
|
|
|
|
|
A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines |
|
|
24 | (12) |
|
|
|
|
|
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs |
|
|
36 | (13) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
DNA Library Screening, Pooling Design and unitary Spaces |
|
|
49 | (12) |
|
|
|
|
|
|
|
|
|
|
|
Improved Algorithms for the Gene Team Problem |
|
|
61 | (12) |
|
|
|
|
|
|
|
Linear Coherent Bi-cluster Discovery via Line Detection and Sample majority Voting |
|
|
73 | (12) |
|
|
|
|
|
|
|
|
|
Combinatorics and Its Applications |
|
|
|
Generalized Russian Cards Problem |
|
|
85 | (13) |
|
|
|
|
|
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations |
|
|
98 | (12) |
|
|
|
|
|
|
|
|
|
Matching Techniques Ride to Rescue OLED Displays |
|
|
110 | (13) |
|
|
|
|
|
|
On Open Rectangle-of-Influence Drawings of Planar Graphs |
|
|
123 | (12) |
|
|
|
|
|
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems |
|
|
135 | (10) |
|
|
|
|
|
|
|
|
|
|
|
Variable-Size Rectangle Covering |
|
|
145 | (10) |
|
|
|
|
|
|
|
On-Line Multiple-Strip Packing |
|
|
155 | (11) |
|
|
|
|
|
|
|
|
|
|
A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game |
|
|
166 | (8) |
|
|
|
|
|
|
|
Improved Bounds for Facility Location Games with Fair Cost Allocation |
|
|
174 | (12) |
|
|
|
|
|
|
|
|
Two-Level heaps: A New Priority Queue Structure with Applications to the Single Source Shortest path Problem |
|
|
186 | (11) |
|
|
|
|
|
On Construction of Almost-Ramanujan Graphs |
|
|
197 | (11) |
|
|
|
|
|
A 2log2(n)-Approximation Algorithm for Directed Tour Cover |
|
|
208 | (11) |
|
|
|
Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation |
|
|
219 | (12) |
|
|
|
|
|
|
Hamiltonian Decomposition of Some Interconnection networks |
|
|
231 | (7) |
|
|
|
|
|
Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge |
|
|
238 | (11) |
|
|
|
A Note on Edge Choosability and Degeneracy of Planar Graphs |
|
|
249 | (9) |
|
|
|
|
|
A Suffcient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices |
|
|
258 | (11) |
|
|
|
On Integrity of Harary Graphs |
|
|
269 | (10) |
|
|
|
|
|
|
|
A Note on n-Critical Bipartite Graphs and Its Application |
|
|
279 | (8) |
|
|
|
|
|
Network Models and problems |
|
|
|
Real-Time Algorithm Scheme for n-Vehicle Exploration Problem |
|
|
287 | (14) |
|
|
|
|
|
Deterministically Estimating Data Stream Frequencies |
|
|
301 | (12) |
|
|
|
Positive Influence Dominating Set in Online Social Networks |
|
|
313 | (9) |
|
|
|
|
|
|
|
|
|
|
Optimal Algorithms for the Online Time Series Search Problem |
|
|
322 | (12) |
|
|
|
|
|
|
|
A Risk-Reward Competitive Analysis for the Newsboy Problem with Range Information |
|
|
334 | (12) |
|
|
|
|
|
Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine |
|
|
346 | (8) |
|
|
|
|
|
|
|
|
|
A note on Online Scheduling for Jobs with Arbitrary Release Times |
|
|
354 | (9) |
|
|
|
|
|
|
|
|
Size-Constrained Tree partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem |
|
|
363 | (12) |
|
|
|
|
|
|
|
On Disjoint Shortest Paths Routing on the Hypercube |
|
|
375 | (9) |
|
|
|
|
|
|
|
|
|
A New Approach for Rearrangeable Multicast Switching Networks |
|
|
384 | (11) |
|
|
|
|
|
|
|
|
Bicriteria Scheduling on Singe-Machine with Inventory Operations |
|
|
395 | (8) |
|
|
|
|
|
|
|
Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine |
|
|
403 | (8) |
|
|
|
|
|
|
|
|
|
Scheduling with Rejection to Minimize the Makespan |
|
|
411 | (10) |
|
|
|
|
|
|
|
Scheduling Problems in Cross Docking |
|
|
421 | (9) |
|
|
|
|
|
|
|
Makespan Minimization with Machine Availability Constraints |
|
|
430 | (8) |
|
|
|
|
|
|
|
A Mathematical Programming Approach for Online Hierarchical Scheduling |
|
|
438 | (13) |
|
|
|
|
|
Recoverable Robust Timetables on Trees |
|
|
451 | (12) |
|
|
|
|
|
|
|
|
|
Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems |
|
|
463 | (8) |
|
|
|
|
|
|
|
|
|
Integrated Production and Delivery Scheduling with Disjoint Windows |
|
|
471 | (12) |
|
|
|
|
|
|
|
Wireless and Optical Networks |
|
|
|
Fault-Tolerant Routing: k-Inconnected many-to-One Routing in Wireless Networks |
|
|
483 | (11) |
|
|
|
|
|
|
|
A Branch-and-cut Algorithm for the Minimum Energy Symmetric Connectivity problem in Wireless Networks |
|
|
494 | (13) |
|
|
|
|
|
Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks Directional Antennas |
|
|
507 | (12) |
|
|
|
|
|
Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings |
|
|
519 | (11) |
|
|
|
|
|
|
|
An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings |
|
|
530 | (11) |
|
|
|
|
|
|
| Author Index |
|
541 | |
Biežāk uzdotie jautājumi par e-grāmatām