343 results on '"Martin Skutella"'
Search Results
102. WAOA 2015 Special Issue on TOCS.
103. The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders.
104. Universal Sequencing on an Unreliable Machine.
105. A tight bound on the speed-up through storage for quickest multi-commodity flows.
106. Approximating the single source unsplittable min-cost flow problem.
107. Preemptive Scheduling with Rejection.
108. Cooperative facility location games.
109. Real-time Avionics Optimization.
110. A note on the generalized min-sum set cover problem.
111. Continuous and discrete flows over time - A general model based on measure theory.
112. Computing Minimum Cuts by Randomized Search Heuristics.
113. Nash Equilibria and the Price of Anarchy for Flows over Time.
114. Length-bounded cuts and flows.
115. Earliest Arrival Flows in Networks with Multiple Sinks.
116. On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency.
117. Evolutionary Algorithms and Matroid Optimization Problems.
118. Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.
119. A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines.
120. Convex Quadratic Programming Relaxations for Network Scheduling Problems.
121. Latency-constrained aggregation in sensor networks.
122. Flows with unit path capacities and related packing and covering problems.
123. Online Scheduling with Bounded Migration.
124. Earliest Arrival Flows with Multiple Sources.
125. Single-source k-splittable min-cost flows.
126. Multiline Addressing by Network Flow.
127. Semidefinite Relaxations for Parallel Machine Scheduling.
128. A short proof of the VPN Tree Routing Conjecture on ring networks.
129. Maximum k -Splittable s , t -Flows.
130. Protection of flows under targeted attacks.
131. Parallel Repetition of MIP(2, 1) Systems.
132. Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria.
133. Random-Based Scheduling: New Approximations and LP Lower Bounds.
134. Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem.
135. An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.
136. Multicommodity flows over time: Efficient algorithms and complexity.
137. Quickest Flows Over Time.
138. New Approaches for Virtual Private Network Design.
139. The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots.
140. Flows on few paths: Algorithms and lower bounds.
141. Flows over Time with Load-Dependent Transit Times.
142. Approximating k-hop minimum-spanning trees.
143. The k-Splittable Flow Problem.
144. Stochastic Machine Scheduling with Precedence Constraints.
145. Cooperative facility location games.
146. Scheduling with AND/OR Precedence Constraints.
147. Preemptive scheduling with rejection.
148. The complexity of economic equilibria for house allocation markets.
149. Special issue of the ISMP 2012 in Berlin.
150. Approximating the single source unsplittable min-cost flow problem.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.