Catch them if you can

DOI10.1145/2422436.2422489MaRDI QIDQ2986895zbMATH OpenOpenAlexFDO

Authors Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, Piotr Sankowski

Publication date 16 May 2017

Published in Proceedings of the 4th conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2422436.2422489

zbMATH Keywords

bipartite matchingimpatienceonline algorithmsstochastic models

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Online algorithms; streaming algorithms (68W27) Queues and service in operations research (90B22) Stochastic programming (90C15) Combinatorial optimization (90C27)

Recommendations

• To satisfy impatient web surfers is hard
• scientific article; zbMATH DE number 3858809
• On Queueing with Customer Impatience Until the End of Service
• On queueing with customer impatience until the beginning of service
• A single server queue with impatient and feedback customers
• Routing and staffing in customer service chat systems with impatient customers
• The slow server problem for uninformed customers
• Queues with slow servers and impatient customers

Cites work

• A model of interactive teaching
• A theory of goal-oriented communication
• A theory of the learnable
• Algorithmic Learning Theory
• Derandomizing polynomial identity tests means proving circuit lower bounds
• scientific article; zbMATH DE number 3154781 (Why is no real title available?)
• scientific article; zbMATH DE number 67625 (Why is no real title available?)
• scientific article; zbMATH DE number 67631 (Why is no real title available?)
• scientific article; zbMATH DE number 1559537 (Why is no real title available?)
• In search of an easy witness: Exponential time vs. probabilistic polynomial time.
• Learning from different teachers
• Measuring teachability using variants of the teaching dimension
• Models of cooperative teaching and learning
• Occam's razor
• On specifying Boolean functions by labelled examples
• On the complexity of teaching
• On the limits of efficient teachability
• On the power of inductive inference from good examples
• Pseudorandom generators for space-bounded computation
• Recent Developments in Algorithmic Teaching
• Teachability in computational learning
• Teaching a smarter learner.
• Teaching Randomized Learners

Cited in

(3)

• Benefits of providing amenities to impatient waiting customers.
• To satisfy impatient web surfers is hard
• Time to market and impatient customers

This page was built for publication: Catch them if you can

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986895)